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.
(http://ing.unlp.edu.ar/cetad/mos/Hamilton.html).
(1997-07-18)

Tagged:

Read Also:

  • Hanau

    [hah-nou] /ˈhɑ naʊ/ noun 1. a city in Hesse, central Germany. /German ˈhaːnau/ noun 1. a city in central Germany, in Hesse east of Frankfurt am Main: a centre of the jewellery industry. Pop: 88 897 (2003 est)

  • Hanbali

    [han-buh-lee] /ˈhæn bə li/ noun, Islam. 1. one of the four schools of Islamic law, founded by Ahmad ibn Hanbal.



  • Hance

    /hæns/ noun 1. a variant of haunch (sense 3)

  • Han-cities

    plural noun 1. . [woo-hahn] /ˈwuˈhɑn/ noun 1. Pinyin, Wade-Giles. a conglomerate city in and the capital of Hubei province, in E China, at the junction of the Han Shui and Chang Jiang: comprises the former cities of Hankou, Hanyang, and Wuchang. /ˈwuːˈhæn/ noun 1. a city in SE China, in Hubei province, at the […]



Disclaimer: Hamiltonian problem definition / meaning should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional. All content on this website is for informational purposes only.