Chapter

Graph-Theoretic Concepts in Computer Science

Volume 3353 of the series Lecture Notes in Computer Science pp 1-19

Lexicographic Breadth First Search – A Survey

  • Derek G. CorneilAffiliated withLancaster UniversityDepartment of Computer Science, University of Toronto

* Final gross prices may vary according to local VAT.

Get Access

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.