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