Hamilton. {William Hamilton} Hamiltonian cycle. {Hamiltonian problem} Hamiltonian path. {Hamiltonian problem} 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. {Home (http://www.ing.unlp.edu.ar/cetad/mos/Hamilton.html)}. (1997-07-18) Hamiltonian tour. {Hamiltonian problem} Hamilton's problem. {Hamiltonian problem} hammer. Commonwealth hackish synonym for {bang on}. [{Jargon File}] (1995-02-16) Hamming code. Extra, redundant bits added to stored or transmitted data for the purposes of {error detection and correction}. Named after the mathematician {Richard Hamming}, Hamming codes greatly improve the reliability of data, e.g. from distant space probes, where it is impractical, because of the long transmission delay, to correct errors by requesting retransmission. [Detail? Connection with {Hamming Distance}?] (2002-07-02) Hamming distance. The minimum number of {bits} that must be changed in order to convert one {bit string} into another. Named after the mathematician {Richard Hamming}. [Connection with {Hamming code}?]. (2002-07-02) Hamming, Richard. {Richard Hamming}
