Browsing by Author "Robert E. Hartwig, Committee Member"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • No Thumbnail Available
    Hamilton Cycle Heuristics in Hard Graphs
    (2004-03-23) Shields, Ian Beaumont; Jon Doyle, Committee Member; Matthias F. Stallmann, Committee Member; Robert E. Hartwig, Committee Member; Carla D. Savage, Committee Chair
    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.