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.
","abstract_html":"<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>","abstract_has_math":false,"creators":["Kaminanai, Srihder"],"institution":null,"degree_name":"Master of Science","degree_level":null,"degree_discipline":"Department of Mathematics and Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2005,"date_issued":"2005-08-01T07:00:00Z","date_published":"2005-08-01T07:00:00Z","updated_at":"2026-07-24T06:07:28Z","subjects":["Computer Sciences"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.wku.edu/theses/504","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Kaminanai, Srihder"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Department of Mathematics and Computer Science"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Sciences"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.wku.edu/theses/504"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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.
"]},{"key":"dc:title","label":"Title","values":["Finding Hamiltonian Cycles"]}]}],"canonical_facts":{"dc:creator":["Kaminanai, Srihder"],"dc:description.abstract":["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.
"],"dc:identifier":["https://digitalcommons.wku.edu/theses/504"],"dc:subject":["Computer Sciences"],"dc:title":["Finding Hamiltonian Cycles"],"dc:type":["Thesis"],"thesis:degree_discipline":["Department of Mathematics and Computer Science"],"thesis:degree_name":["Master of Science"]},"updated_at":"2026-07-24T06:07:28Z"}