On end-vertices of Lexicographic Breadth First Searches

@article{Corneil2010OnEO,
  title={On end-vertices of Lexicographic Breadth First Searches},
  author={Derek G. Corneil and Ekkehard K{\"o}hler and Jean-Marc Lanlignel},
  journal={Discrete Applied Mathematics},
  year={2010},
  volume={158},
  pages={434-443}
}
Recently Lexicographic Breadth First Search (LBFS) has received considerable attention and has often been employed in amulti-sweep fashion. One variant of LBFS called LBFS+ breaks ties by choosing the last vertex of the tied set in a previous LBFS. This has motivated the study of vertices that may appear last in an LBFS (called end-vertices). In this paper, we present various theoretical and algorithmic results concerning end-vertices. © 2009 Elsevier B.V. All rights reserved. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-7 of 7 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Almost Diameter of a House-hole-free Graph in Linear Time Via LexBFS

Discrete Applied Mathematics • 1999
View 4 Excerpts
Highly Influenced

A Unified View of Graph Searching

SIAM J. Discrete Math. • 2008
View 2 Excerpts

Lex-bfs and partition refinement

M. Habib, R. McConnell, C. Paul, L. Viennot
with applications to transitive orientation, interval graph recognition and consecutive ones testing, Theoret. Comput. Sci. 234 • 2000

Similar Papers

Loading similar papers…