MinimumVertexCover
Combinatorica`
Combinatorica`
MinimumVertexCover
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
MinimumVertexCover[g]
finds a minimum vertex cover of graph g.
更多信息和选项
- MinimumVertexCover functionality is now available in the built-in Wolfram Language function FindVertexCover.
- To use MinimumVertexCover, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
- For bipartite graphs, the function uses the polynomial-time Hungarian algorithm. For everything else, the function uses brute force.
Wolfram Research (2012)，MinimumVertexCover，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/MinimumVertexCover.html.
文本
Wolfram Research (2012)，MinimumVertexCover，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/MinimumVertexCover.html.
CMS
Wolfram 语言. 2012. "MinimumVertexCover." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/MinimumVertexCover.html.
APA
Wolfram 语言. (2012). MinimumVertexCover. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/MinimumVertexCover.html 年