Close
Register
Close Window

Senior Algorithms

Chapter 8 Limits to Computing

Show Source |    | About   «  8.17. Reduction of 3-SAT to Hamiltonian Cycle   ::   Contents   ::   8.19. Reduction of Hamiltonian Cycle to Traveling Salesman  »

8.18. Reduction of Clique to Independent Set

8.18.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.

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

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

   «  8.17. Reduction of 3-SAT to Hamiltonian Cycle   ::   Contents   ::   8.19. Reduction of Hamiltonian Cycle to Traveling Salesman  »

nsf

© Copyright 2011-2023 by OpenDSA Project Contributors and distributed under an MIT license. Last updated on Oct 01, 2023. Created using Sphinx 4.4.0.
Close Window