Combinatorica`
Combinatorica`

GreedyVertexCover

バージョン10で，Combinatorica パッケージの機能のほとんどがWolframシステムに組み込まれた． »

GreedyVertexCover[g]

欲張り法を使って構築したグラフ g の頂点被覆を返す．これは頂点被覆を構築するための自然でヒューリスティックな方法であるが，生成された頂点被覆があまりよくないこともある．

詳細とオプション

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 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

BibTeX

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

BibLaTeX

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