Hamilton Cycle Heuristics in Hard Graphs
No Thumbnail Available
Files
Date
2004-03-23
Authors
Journal Title
Series/Report No.
Journal ISSN
Volume Title
Publisher
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.
Description
Keywords
Hamilton cycle algorithms, graph theory
Citation
Degree
PhD
Discipline
Computer Science