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.
Details and Options
- 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 Language function, https://reference.wolfram.com/language/Combinatorica/ref/GreedyVertexCover.html.
Text
Wolfram Research (2012), GreedyVertexCover, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/GreedyVertexCover.html.
CMS
Wolfram Language. 2012. "GreedyVertexCover." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/GreedyVertexCover.html.
APA
Wolfram Language. (2012). GreedyVertexCover. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/GreedyVertexCover.html