Hamilton Cycle Heuristics in Hard Graphs

Hamilton cycle algorithms;graph theory

Shields, Ian Beaumont ; Jon Doyle, Committee Member,Matthias F. Stallmann, Committee Member,Robert E. Hartwig, Committee Member,Carla D. Savage, Committee Chair,Shields, Ian Beaumont ; Jon Doyle ; Committee Member ; Matthias F. Stallmann ; Committee Member ; Robert E. Hartwig ; Committee Member ; Carla D. Savage ; Committee Chair

University:North Carolina State University

关键词: Hamilton cycle algorithms;    graph theory;   

Others  :  https://repository.lib.ncsu.edu/bitstream/handle/1840.16/3808/etd.pdf?sequence=1&isAllowed=y

美国|英语

来源: null

【 摘 要 】

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.