28.17. Reduction of Independent Set to Vertex Cover¶
28.17.1. Independent Set to Vertex Cover¶
The following slideshow shows that an instance of Independent Set problem can be reduced to an instance of Vertex Cover problem in polynomial time.
This reduction can help in providing an NP Completeness proof for the Vertex Cover problem.