As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. >>

finds a minimum vertex cover of graph g.


  • MinimumVertexCover functionality is now available in the built-in Wolfram Language function FindVertexCover.
  • To use MinimumVertexCover, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
  • For bipartite graphs, the function uses the polynomial-time Hungarian algorithm. For everything else, the function uses brute force.
Translate this page: