Abstract
Lexicographic Breadth First Search, introduced by Rose, Tarjan and Lueker for the recognition of chordal graphs is currently the most popular graph algorithmic search paradigm, with applications in recognition of restricted graph families, diameter approximation for restricted families and determining a dominating pair in an AT-free graph. This paper surveys this area and provides new directions for further research in the area of graph searching. © Springer-Verlag 2004.
Cite
CITATION STYLE
Corneil, D. G. (2004). Lexicographic breadth first search - A survey. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3353, 1–19. https://doi.org/10.1007/978-3-540-30559-0_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
