Finding Hamiltonian Cycles

<p>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.</p>

Name thesis:degree_name

Master of Science

Discipline thesis:degree_discipline

Department of Mathematics and Computer Science

Year

2005

Author dc:creator

• Kaminanai, Srihder

• Computer Sciences

Repository record dc:identifier

https://digitalcommons.wku.edu/theses/504

OAI identifier oai:identifier

oai:digitalcommons.wku.edu:theses-1507