Hamiltonian problem
<computability> (Or "Hamilton's problem") A problem in graph theory posed by William Hamilton: given a graph, is there a path through the graph which visits each vertex precisely once (a "Hamiltonian path")?
Is there a Hamiltonian path which ends up where it started (a "Hamiltonian cycle" or "Hamiltonian tour")?
Hamilton's problem is NP-complete.
It has numerous applications, sometimes completely unexpected, in computing.
Home (http://www.ing.unlp.edu.ar/cetad/mos/Hamilton.html).
| < Previous Terms | Terms Containing Hamiltonian problem | Next Terms > |
| Halt and Catch Fire halting problem Hamilton Hamiltonian cycle Hamiltonian path | Hamiltonian cycle Hamiltonian path Hamiltonian tour Hamilton's problem | Hamiltonian tour Hamilton's problem hammer Hamming code Hamming distance |
