Combinatorica`
Combinatorica`
GreedyVertexCover
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
GreedyVertexCover[g]
returns a vertex cover of graph 
constructed using the greedy algorithm. This is a natural heuristic for constructing a vertex cover, but it can produce poor vertex covers.
更多信息和选项
- GreedyVertexCover functionality is now available in the built-in Wolfram Language function FindVertexCover.
- To use GreedyVertexCover, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Wolfram Research (2012)，GreedyVertexCover，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/GreedyVertexCover.html.
文本
Wolfram Research (2012)，GreedyVertexCover，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/GreedyVertexCover.html.
CMS
Wolfram 语言. 2012. "GreedyVertexCover." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/GreedyVertexCover.html.
APA
Wolfram 语言. (2012). GreedyVertexCover. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/GreedyVertexCover.html 年