Combinatorica`
Combinatorica`

BipartiteMatchingAndCover

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

BipartiteMatchingAndCover[g]

takes a bipartite graph g and returns a matching with maximum weight along with the dual vertex cover. If the graph is not weighted, it is assumed that all edge weights are 1.

Details

Examples

Basic Examples  (2)

BipartiteMatchingAndCover has been superseded by FindIndependentEdgeSet:

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

Text

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

BibTeX

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

BibLaTeX

@online{reference.wolfram_2021_bipartitematchingandcover, organization={Wolfram Research}, title={BipartiteMatchingAndCover}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/BipartiteMatchingAndCover.html}, note=[Accessed: 30-November-2021 ]}

CMS

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

APA

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