hamiltonian problem

Computing Dictionary

Hamiltonian problem definition

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.
(http://ing.unlp.edu.ar/cetad/mos/Hamilton.html).
(1997-07-18)
The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source
Explore Dictionary.com
Previous Definition: hamiltonian path
Next Definition: hamiltonian tour
More from Thesaurus.com
Synonyms and Antonyms for Hamiltonian problem
More from Reference.com
Search for articles containing Hamiltonian problem
Dictionary.com Word FAQs

Dictionary.com presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014 Dictionary.com, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature