finds a vertex cover of the graph g with a minimum number of vertices.


  • FindVertexCover returns a list of vertices.
  • FindVertexCover will return an empty list if no vertex cover is found.
  • A vertex cover is a set of vertices that is incident to every edge.
  • FindVertexCover works with undirected graphs, directed graphs, weighted graphs, multigraphs, and mixed graphs.
Introduced in 2010
| Updated in 2014
Translate this page: