Close
Close Window

Show Source |    | About   «  28.17. Reduction of Independent Set to Vertex Cover   ::   Contents   ::   28.19. Reduction of Hamiltonian Cycle to Traveling Salesman  »

28.18. Reduction of 3-SAT to Hamiltonian Cycle

28.18.1. 3-SAT to Hamiltonian Cycle

The following slideshow shows that an instance of the 3-CNF Satisfiability (3-SAT) problem can be reduced to an instance of Hamiltonian Cycle in polynomial time. A trivial change in the construction will allow reduction from 3-SAT to the Hamiltonian Path problem.

1 / 25 Settings
<<<>>>

This slideshow explains the reduction (in polynomial time) of an instance of 3CNF Satisfiability (3-SAT) to an instance of the Hamiltonian Cycle problem.

Created with Raphaël 2.1.2
Proficient Saving... Error Saving
Server Error
Resubmit

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

   «  28.17. Reduction of Independent Set to Vertex Cover   ::   Contents   ::   28.19. Reduction of Hamiltonian Cycle to Traveling Salesman  »

Close Window