- Bib ID:
- 3416917
- Format:
- Book and Microform
- Author:
- Shields, Ian Beaumont
- Description:
- 109 p.
- Summary:
-
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.
- Notes:
-
- (UnM)AAI3120258
- Director: Carla D. Savage.
- Source: Dissertation Abstracts International, Volume: 65-01, Section: B, page: 0295.
- Thesis (Ph.D.)--North Carolina State University, 2004.
- Reproduction:
- Microfiche. Ann Arbor, Mich.: University Microfilms International.
- Subject:
- Computer Science
- Other authors/contributors:
- North Carolina State University
- Copyright:
-
In Copyright
Contact us for information about copying.
Copyright status was determined using the following information:
- Material type:
- Literary Dramatic Musical
- Published status:
- Unpublished
- Creation date:
- 2004
Copyright status may not be correct if data in the record is incomplete or inaccurate.
Other access conditions may also apply. For more information please see:
Copyright in library collections.
Request this item
Request this item to view in the Library’s reading room.