25.16. Reduction of Independent Set to Vertex Cover¶
25.16.1. Independent Set to Vertex Cover¶
The following slideshow shows that an input instance to INDEPENDENT SET can be reduced to an equivalent input instance to VERTEX COVER in polynomial time.
This reduction can help in providing an NP Completeness proof for the Vertex Cover problem.
