Combinatorica`
Combinatorica`

BipartiteMatching

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »

BipartiteMatching[g]

gives the list of edges associated with a maximum matching in bipartite graph g. If the graph is edge weighted, then the function returns a matching with maximum total weight.

Details

Examples

Basic Examples  (2)

BipartiteMatching has been superseded by FindIndependentEdgeSet:

Wolfram Research (2012), BipartiteMatching, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/BipartiteMatching.html.

Text

Wolfram Research (2012), BipartiteMatching, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/BipartiteMatching.html.

BibTeX

@misc{reference.wolfram_2021_bipartitematching, author="Wolfram Research", title="{BipartiteMatching}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/BipartiteMatching.html}", note=[Accessed: 05-December-2021 ]}

BibLaTeX

@online{reference.wolfram_2021_bipartitematching, organization={Wolfram Research}, title={BipartiteMatching}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/BipartiteMatching.html}, note=[Accessed: 05-December-2021 ]}

CMS

Wolfram Language. 2012. "BipartiteMatching." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/BipartiteMatching.html.

APA

Wolfram Language. (2012). BipartiteMatching. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/BipartiteMatching.html