(computability) | Hamiltonian problem - (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://www.ing.unlp.edu.ar/cetad/mos/Hamilton.html. |

Browse

hamburger roll

hamburger steak

Hame

Hamel

hamelia

Hamelia erecta

Hamelia patens

Hamesecken

Hamesucken

Hamfatter

Hamiform

Hamilton

Hamilton period

Hamilton's problem

Hamiltonian cycle

Hamiltonian path

**-- Hamiltonian problem --**

Hamiltonian tour

Haminoea

Haminura

Hamite

Hamitic

Hamitic language

Hamitic languages

Hamito-Semitic

Hamlet

Hamleted

Hammarskjold

Hammer

hammer and sickle

Hammer break

Hammer fish

Hammer hardening

hamburger steak

Hame

Hamel

hamelia

Hamelia erecta

Hamelia patens

Hamesecken

Hamesucken

Hamfatter

Hamiform

Hamilton

Hamilton period

Hamilton's problem

Hamiltonian cycle

Hamiltonian path

Hamiltonian tour

Haminoea

Haminura

Hamite

Hamitic

Hamitic language

Hamitic languages

Hamito-Semitic

Hamlet

Hamleted

Hammarskjold

Hammer

hammer and sickle

Hammer break

Hammer fish

Hammer hardening