Hamilton Cycle Heuristics in Hard Graphs

Show simple item record

dc.contributor.advisor Jon Doyle, Committee Member en_US
dc.contributor.advisor Matthias F. Stallmann, Committee Member en_US
dc.contributor.advisor Robert E. Hartwig, Committee Member en_US
dc.contributor.advisor Carla D. Savage, Committee Chair en_US
dc.contributor.author Shields, Ian Beaumont en_US
dc.date.accessioned 2010-04-02T18:36:57Z
dc.date.available 2010-04-02T18:36:57Z
dc.date.issued 2004-03-23 en_US
dc.identifier.other etd-03142004-013420 en_US
dc.identifier.uri http://www.lib.ncsu.edu/resolver/1840.16/3808
dc.description.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. en_US
dc.rights I hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to NC State University or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report. en_US
dc.subject Hamilton cycle algorithms en_US
dc.subject graph theory en_US
dc.title Hamilton Cycle Heuristics in Hard Graphs en_US
dc.degree.name PhD en_US
dc.degree.level dissertation en_US
dc.degree.discipline Computer Science en_US

Files in this item

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

This item appears in the following Collection(s)

Show simple item record