Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp01xp68kj658
Title: On Graph Searches, Chordal and AT-Free Graphs
Authors: Zhan, Irvan
Advisors: Tarjan, Robert
Department: Computer Science
Class Year: 2016
Abstract: Chordal and AT-free graphs are two graph families that have numerous applications in biology, operational optimization, computation, and mathematics. Lexicographical breadth-first search and other graph searches has had some surprising applications in identifying structural characteristics of these types of graphs. In this paper, we will survey known results on these two graph families, discuss applications of LBFS to these graphs, and provide directions for further research. 2
Extent: 36 pages
URI: http://arks.princeton.edu/ark:/88435/dsp01xp68kj658
Type of Material: Princeton University Senior Theses
Language: en_US
Appears in Collections:Computer Science, 1988-2016

Files in This Item:
File SizeFormat 
zhan_irvin_2016_Thesis.pdf331.06 kBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.