Close
Register
Close Window

OpenDSA Complete Catalog

Chapter 25 Limits to Computing

| About   «  25.17. Reduction of 3-SAT to Hamiltonian Cycle   ::   Contents   ::   25.19. Reduction of Hamiltonian Cycle to Traveling Salesman  »

25.18. Reduction of Clique to Independent Set

25.18.1. Clique to Independent Set

The following slideshow shows that an instance of CLIQUE can be reduced to an equivalent instance of INDEPENDENT SET in polynomial time.

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

This reduction can help in providing an NP Completeness proof for the Independent Set problem.

   «  25.17. Reduction of 3-SAT to Hamiltonian Cycle   ::   Contents   ::   25.19. Reduction of Hamiltonian Cycle to Traveling Salesman  »

Close Window