Close
Register
Close Window

OpenDSA Stand-alone Modules

Chapter 0 modules

Show Source |    | About   «  0.224. Reduction of 3-SAT to Hamiltonian Cycle   ::   Contents   ::   0.226. Coping with NP-Complete Problems  »

Reduction of Hamiltonian Cycle to Traveling Salesman

1. Hamiltonian Cycle to Traveling Salesman

The following slideshow shows that an instance of Hamiltonian Cycle problem can be reduced to an instance of Traveling Salesman problem in polynomial time.

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

This reduction can help in providing an NP Completeness proof for the Traveling Salesman problem.

   «  0.224. Reduction of 3-SAT to Hamiltonian Cycle   ::   Contents   ::   0.226. Coping with NP-Complete Problems  »

nsf
Close Window