Department of Mathematics and Computer Science
Master of Science
Finding a Hamiltonian cycle in a graph is used for solving major problems in areas such as graph theory, computer networks, and algorithm design. In this thesis various approaches of Hamiltonian cycle algorithms such as backtrack algorithms and heuristic algorithms, their basic ideas, and their actual implementations are studied. Three specific implementations are explained in detail and tested with randomly generated 4-regular planar graphs that are 2-connected and 4-edge connected. The results are analyzed and reported.
Kaminanai, Srihder, "Finding Hamiltonian Cycles" (2005). Masters Theses & Specialist Projects. Paper 504.