DOCUMENTATION CENTER SEARCH

New to Mathematica? Find your learning path »

Combinatorica Package >

COMBINATORICA PACKAGE SYMBOL

Tutorials »|See Also »|More About »

MinimumVertexCover

MinimumVertexCover[g]
finds a minimum vertex cover of graph

.

MORE INFORMATION

To use , you first need to load the Combinatorica Package using .

For bipartite graphs, the function uses the polynomial-time Hungarian algorithm. For everything else, the function uses brute force.

MaximumClique MaximumIndependentSet VertexCoverQ

Combinatorica

Constructing Graphs

Ask a question about this page | Suggest an improvement | Leave a message for the team

Format: HTML | CDF