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 g constructed using the greedy algorithm. This is a natural heuristic for constructing a vertex cover, but it can produce poor vertex covers.

Details

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.

BibTeX

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

BibLaTeX

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

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