Reductions

• VERTEX-COVER = { < G, k > | G is an undirected graph that has a k-node vertex cover

  • Vertex cover is a subset of nodes such that every edge in the graph touches at least one node in the cover

Previous slide

Next slide

Back to first slide

View graphic version