Close
Register
Close Window

CS4104 Data and Algorithm Analysis

Chapter 8 Limits to Computing

Show Source |    | About   «  8.16. Reduction of Independent Set to Vertex Cover   ::   Contents   ::   8.18. Coping with NP-Complete Problems  »

8.17. Reduction of 3-SAT to Hamiltonian Cycle

8.17.1. 3-SAT to Hamiltonian Cycle

The following slideshow shows that an instance of 3-CNF Satisfiability problem can be reduced to an instance of Hamiltonian Cycle problem in polynomial time.

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

This reduction can help in providing an NP Completeness proof for the Hamiltonian Cycle problem.

   «  8.16. Reduction of Independent Set to Vertex Cover   ::   Contents   ::   8.18. Coping with NP-Complete Problems  »

nsf
Close Window