二分图匹配

通过在软件中采用网络拓扑技术[4]和二分图匹配[5]以及Dijkstra算法[5]等方法，成功地解决了设备端子排和电缆表的自动生成问题，并对设计结果进行了优化。

By using the network topological technique [ 4 ] , bipartite graph matching technique [ 5 ] and Dijkstra algorithm [ 5 ] , the software can generate the electrical device terminals and cable list automatically , meanwhile , the design result is optimized .

匈牙利算法是图论中完成二分图匹配的经典算法之一。

Hungary algorithm is a classical one to solve bipartite graph matching problem .

基于二分图匹配的一类多机调度问题研究

Research of a Class of Scheduling Problem of Multicomputer Based on Bipartite Graph Matching

在骨架匹配方面，论文提出了一种基于加权最优二分图匹配技术的骨架匹配技术。

In the skeleton matching , an novel approach based on weighted optimal bipartite graph matching theory is also presented .

角色分配算法采用二分图匹配算法，而角色决策模型为有限状态自动机模型。在有限状态自动机模型中，详细描述了前锋和守门员的状态转换过程，最后介绍了机器人的基本动作。

Roles assignment algorithm adopts dimidiate graph algorithm and roles decision model is the finite state automaton model which elaborates the process of state transition between the forward and the goalkeeper .

其次，根据二分图匹配算法为电气原理图中继电元件选择合适的型号和规格，并采用人工干预和自动布置相结合的方法完成屏面布置图的自动生成；

Secondly , the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm , and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention .

一种基于二分图最优匹配的重复记录检测算法

Duplicate Record Detection Method Based on Optimal Bipartite Graph Matching

基于二分图完美匹配的布尔匹配算法

Boolean Mapping Algorithm Based on Perfect Matching of Bipartite Graph

提出了一种改进的基于二分图完美匹配的布尔匹配算法。

An improved Boolean matching algorithm based on transforming the mapping between Boolean variables into the problem of perfect matching of bipartite graph is presented .

基于二分图最优匹配的重复记录检测算法具有考虑到模式异构，支持多种数据类型等特点，适用于大量异构数据源情况的重复记录检测。

Method which based on optimal bipartite graph matching considered the case of heterogeneous , and therefore more suitable for multi-source environment data of duplicate records detection .

运用改进的二分图的完美匹配算法，得到矢量数组的匹配度。

The matching degree of vectors is gained in the way of developed perfect matching algorithm of bipartite graph .

该算法通过把布尔变量之间的匹配问题转换为二分图的完美匹配问题，避免了原算法中因乘积项过多而导致计算时间过长的缺点。

This approach can overcome the shortcoming of the original algorithm , i.e. , lengthy computation time caused by the excessive product terms .

把复杂网络映射到线性系统上，利用二分图的最大匹配算法，非匹配节点作为驱动节点。

The complex network is mapped to a linear system , using the algorithm of bipartite graph maximum matching , and the non-matching node act as the driver nodes .

进一步的，论文针对拓扑连接图用于相似度计算存在的局限性，提出从两个模型的分割结果中构造二分图，把相似度计算转化为二分图的最大匹配问题。

The thesis further discusses the limitation of the topological connection graph based similarity calculation . Then Bipartite Graph is introduced to compute the similarity between models .