1) maximum cardinality matching
最大基数匹配
1.
The algorithm of merging is based on maximum cardinality matching and can merge some LUTs.
该算法基于图的最大基数匹配,将部分查找表进行合并,减小了映射结果的面积开销。
2) matching of maximum cardinality
最大匹配基
1.
Then,a matching of maximum cardinality of G corresponds to an optimal movement plan which maximizes the network coverage subject to minimizing the movement costs.
对构造的二部图G求它的最小花费的最大匹配基,则该匹配基对应着一个最优的移动方案,按此方案部署的网络覆盖率最大且总的移动花费最小。
3) maximum base number matching algorithm
最大基数匹配算法
4) the maximum real roots of graph's matching polynomial
匹配最大实数根
5) maximal match
最大匹配
1.
Through the discussion of the optimum disposition of human resources,a method is proposed to transform the problem of the optimal match into the maximal match.
通过对人力资源优化配置问题的讨论,给出了将该问题转化成求最大匹配问题的方法;通过用匈牙利算法求解对应的匹配问题,得出该资源分配问题的最优解。
2.
In this method, we evaluate the importance level of different targets with fuzzy clustering algorithm and fuzzy recognising algorithm, then obtain the maximal match between missiles and targets by maximal match algorithm of bipartite graph.
介绍了多机协同攻击多目标的基本概念 ,提出了在用模糊聚类和模糊识别算法对目标进行重要性等级评价的基础上 ,运用二部图的最大匹配算法对导弹和目标进行最大配对的新方法。
6) maximum matching
最大匹配
1.
On the basis of Konig theorem,the relations between the vertices set of M-saturated(M is any maximum matching set of a bipartite graph G)and any minimum covering set of a bipartite graph G,were analyzed.
以Konig定理作为理论基础,分析偶图的任一最大匹配的饱和顶点集与其任一最小覆盖的关系,得出偶图的任一最小覆盖都包含在该偶图的任一最大匹配的饱和顶点集中的结论。
2.
Furthermore, a new method of proving Konig theorem is proposed by finding out maximum matching from minimum vertex-covering.
归纳了图论匹配理论中Konig定理的几种证明方法和思想,并按从最小覆盖出发寻找最大匹配 的思路给出了Konig定理的另一种证明方法。
3.
In the end, the matrix algorithm of search a maximum matching in bipartite graph is given.
最后给出了寻找偶图最大匹配的算法———矩阵算法 ,该算法与匈牙利算法比较具有较高的运算效率和易于在计算机上实现等优
补充资料：基数标准(见基数)
基数标准(见基数)
level of basic load
lishu biaozhun基数标准(level of basic load)见基数。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条