| Hamiltonian problem (Or "Hamilton's problem") A problem in posed by : given a , is there a path through the graph which visits each 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 . It has numerous applications, sometimes completely unexpected, in computing. {Home (http://www.ing.unlp.edu.ar/cetad/mos/Hamilton.html)}. (1997-07-18) |
на заглавную 
к началу страницы