G is said to be bipartitematching extendable (BM-extendable) if every matching m whose induced subgraph is a bipartite graph extends to a perfect matching of g.
称g是偶匹配可扩的，如果G中导出子图是偶图的匹配m都可以扩充为g的完美匹配。
2
This scheduling algorithm takes the bipartite graph matching and the backtracking techniques as mathematical tools.
该算法以偶图匹配、回溯技术为数学工具。
3
This article gives a solution to the programming 0-1 problem whose objective function is a nonlinear function, by applying weighted bipartite graph and perfect matching.