NCSU Institutional Repository >
NC State Theses and Dissertations >
Dissertations >

Please use this identifier to cite or link to this item: http://www.lib.ncsu.edu/resolver/1840.16/3808

Title: Hamilton Cycle Heuristics in Hard Graphs
Authors: Shields, Ian Beaumont
Advisors: Jon Doyle, Committee Member
Matthias F. Stallmann, Committee Member
Robert E. Hartwig, Committee Member
Carla D. Savage, Committee Chair
Keywords: Hamilton cycle algorithms
graph theory
Issue Date: 23-Mar-2004
Degree: PhD
Discipline: Computer Science
Abstract: In this thesis, we use computer methods to investigate Hamilton cycles and paths in several families of graphs where general results are incomplete, including Kneser graphs, cubic Cayley graphs and the middle two levels graph. We describe a novel heuristic which has proven useful in finding Hamilton cycles in these families and compare its performance to that of other algorithms and heuristics. We describe methods for handling very large graphs on personal computers. We also explore issues in reducing the possible number of generating sets for cubic Cayley graphs generated by three involutions.
URI: http://www.lib.ncsu.edu/resolver/1840.16/3808
Appears in Collections:Dissertations

Files in This Item:

File Description SizeFormat
etd.pdf893.59 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.