Added to Favorites

Computing Dictionary

(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)

Explore Dictionary.com

Previous Definition: hamiltonian path

Next Definition: hamiltonian tour

Words Near: hamiltonian problem

More from Thesaurus.com

Synonyms and Antonyms for hamiltonian problem

More from Reference.com

Search for articles containing hamiltonian problem

More from Dictionary.com Translator

Translate hamiltonian problem into French

Translate hamiltonian problem into German

Translate hamiltonian problem into Italian

Dictionary.com Word FAQs

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

Nearby Words

Copyright © 2014 Dictionary.com, LLC. All rights reserved.