Definition: (1) A perfect matching between vertices of a bipartite graph, that is, a subgraph that pairs every vertex with exactly one other vertex. (2) The problem of finding such a matching.
Also known as maximum bipartite matching.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 10 May 2010.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "bipartite matching", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 10 May 2010. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/bipartmatch.html