Hamilton Cycle Heuristics in Hard Graphs

Show full item record

Title: Hamilton Cycle Heuristics in Hard Graphs
Author: Shields, Ian Beaumont
Advisors: Jon Doyle, Committee Member
Matthias F. Stallmann, Committee Member
Robert E. Hartwig, Committee Member
Carla D. Savage, Committee Chair
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.
Date: 2004-03-23
Degree: PhD
Discipline: Computer Science
URI: http://www.lib.ncsu.edu/resolver/1840.16/3808

Files in this item

Files Size Format View
etd.pdf 893.5Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record