Encyclopedia > Hamiltonian cycle problem

  Article Content

Hamiltonian cycle problem

The Hamiltonian cycle or Hamiltonian circuit problem in graph theory is to find a path through a given graph which starts and ends at the same vertex and includes each vertex exactly once.

It is a special case of the traveling salesman problem, obtained by setting the distance between two cities to unity if they are adjacent and infinity otherwise. Like the traveling salesman problem, the Hamiltonian cycle problem is NP-complete.

The requirement that the path start and end at the same vertex distinguishes it from the Hamiltonian path problem.

The problem is named after Sir William Rowan Hamilton. External links



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
French resistance

... 1941 they began to publish Le Franc-Tireur underground newspaper. There were also members in the Mediterranean area. Front National[?] (FN or National Front) – Group ...

 
 
 
This page was created in 48.4 ms