# 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} }

- Published 2010 in Discrete Applied Mathematics
DOI:10.1016/j.dam.2009.10.001

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

## Influence of the tie-break rule on the end-vertex problem

View 18 Excerpts

Highly Influenced

## On the End-Vertex Problem of Graph Searches

View 9 Excerpts

## End-vertices of LBFS of (AT-free) bigraphs

View 2 Excerpts

#### References

##### Publications referenced by this paper.

Showing 1-10 of 13 references

## Algorithmic Aspects of Vertex Elimination on Graphs

View 5 Excerpts

Highly Influenced

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

View 4 Excerpts

Highly Influenced

## The LBFS Structure and Recognition of Interval Graphs

View 7 Excerpts

## A Unified View of Graph Searching

View 2 Excerpts

## Lexicographic Breadth First Search - A Survey

View 3 Excerpts

## Diameter determination on restricted graph families

View 3 Excerpts