Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp01xp68kj658Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Tarjan, Robert | - |
| dc.contributor.author | Zhan, Irvan | - |
| dc.date.accessioned | 2016-07-01T14:05:26Z | - |
| dc.date.available | 2016-07-01T14:05:26Z | - |
| dc.date.created | 2016-04-29 | - |
| dc.date.issued | 2016-07-01 | - |
| dc.identifier.uri | http://arks.princeton.edu/ark:/88435/dsp01xp68kj658 | - |
| dc.description.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 | en_US |
| dc.format.extent | 36 pages | * |
| dc.language.iso | en_US | en_US |
| dc.title | On Graph Searches, Chordal and AT-Free Graphs | en_US |
| dc.type | Princeton University Senior Theses | - |
| pu.date.classyear | 2016 | en_US |
| pu.department | Computer Science | en_US |
| pu.pdf.coverpage | SeniorThesisCoverPage | - |
| Appears in Collections: | Computer Science, 1988-2020 | |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| zhan_irvin_2016_Thesis.pdf | 331.06 kB | Adobe PDF | Request a copy |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.