hamiltonian path

H h

Transcription

- US Pronunciation
- US IPA

- US Pronunciation
- US IPA

Definitions of hamiltonian path words

abbreviation Technical meaning of HAMILTONIAN PATH Hamiltonian problem 3
noun Definition of hamiltonian path in Technology (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. 1
noun hamiltonian path (graph theory) A path through an undirected graph which visits each vertex exactly once. 0

See all 3 definitions of hamiltonian path

Information block about the term

Parts of speech for Hamiltonian path

noun

adjective

verb

adverb

pronoun

preposition

conjunction

determiner

exclamation

Full grammatical hierarchy of Hamiltonian path

See also

Matching words

Was this page helpful?

Yes No

Thank you for your feedback! Tell your friends about this page

Tell us why?