Try Our Apps


Pore Over vs. Pour Over

hamiltonian problem

hamiltonian problem in Technology
(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.
The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source

Word of the Day

Word Value for hamiltonian

Scrabble Words With Friends

Nearby words for hamiltonian problem