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 Black.
Entry modified 10 May 2010.
HTML page formatted Mon Feb 2 13:10:39 2015.
Cite this as:
Paul E. Black, "bipartite matching", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 10 May 2010. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/bipartmatch.html