On end-vertices of Lexicographic Breadth First Searches

Authors:
Derek G. Corneil;Ekkehard Köhler;Jean-Marc Lanlignel
Affiliations:
Department of Computer Science, University of Toronto, Toronto, Ontario, Canada;Mathematisches Institut, Brandenburgische Technische Universität Cottbus, Cottbus, Germany;LIRMM, Université Montpellier II, France
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 10
Cited 1

Domination on cocomparability graphs

SIAM Journal on Discrete Mathematics
LexBFS-orderings and powers of chordal graphs

Discrete Mathematics
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs

SIAM Journal on Computing
The ultimate interval graph recognition algorithm?

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing

Theoretical Computer Science
Diameter determination on restricted graph families

Discrete Applied Mathematics
LexBFS-Orderings and Power of Graphs

WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
A New Simple Linear Algorithm to Recognize Interval Graphs

CG '91 Proceedings of the International Workshop on Computational Geometry - Methods, Algorithms and Applications
A Unified View of Graph Searching

SIAM Journal on Discrete Mathematics
Lexicographic breadth first search – a survey

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

The LBFS Structure and Recognition of Interval Graphs

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

Recently Lexicographic Breadth First Search (LBFS) has received considerable attention and has often been employed in a multi-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.