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.

更多信息和选项

范例

基本范例  (2)

BipartiteMatchingAndCover has been superseded by FindIndependentEdgeSet:

Wolfram Research (2012)，BipartiteMatchingAndCover，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/BipartiteMatchingAndCover.html.

文本

Wolfram Research (2012)，BipartiteMatchingAndCover，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/BipartiteMatchingAndCover.html.

CMS

Wolfram 语言. 2012. "BipartiteMatchingAndCover." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/BipartiteMatchingAndCover.html.

APA

Wolfram 语言. (2012). BipartiteMatchingAndCover. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/BipartiteMatchingAndCover.html 年

BibTeX

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

BibLaTeX

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