Is the problem of finding a Vertex Cover of minimum size in a given Undirected Graph. We call such a vertex cover an optimal vertex cover.
Is the problem of finding a Vertex Cover of minimum size in a given Undirected Graph. We call such a vertex cover an optimal vertex cover.