Bipartite Graph is important data structure for data base system etc.

二部图是数据库等应用系统的重要的数据结构。

A complete bipartite graph is a simple bipartite graph with bipartition.

完全偶图是具有二分类的简单偶图。

The edge chromatic number of join graph with fan and complete balanced bipartite graph was obtained.

得到了扇和完全等二部图联图的边色数。

The architecture is represented by a bipartite graph and its relation with a general graph is also discussed.

文中用两类节点的二分图表示所提出的网络结构，并讨论了其与一般图表示方法问的关系。

This scheduling algorithm takes the bipartite graph matching and the backtracking techniques as mathematical tools.

该算法以偶图匹配、回溯技术为数学工具。