Bipartite matching

摘要

A computer technique for bipartite matching of objects of one subset with objects of a different subset where multiple choices are permitted. A bipartite graph is formed in which the objects form nodes and the edges connecting pairs of nodes represent costs of matching the nodes connected. The original tour or graph is decomposed into a plurality of quasi-convex subtours or subgraphs and the minimum cost match of each subtour is found and the union of all such matches of the subtours is used as the desired match.