Journal of Combinatorial Theory Series B
A unified approach to domination problems on interval graphs
Information Processing Letters
An incremental linear-time algorithm for recognizing interval graphs
SIAM Journal on Computing
An optimal greedy heuristic to color interval graphs
Information Processing Letters
Domination on cocomparability graphs
SIAM Journal on Discrete Mathematics
LexBFS-orderings and powers of chordal graphs
Discrete Mathematics
Separability generalizes Dirac's theorem
Discrete Applied Mathematics
Graph classes: a survey
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
SIAM Journal on Computing
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The ultimate interval graph recognition algorithm?
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Diameter determination on restricted graph families
Discrete Applied Mathematics
LexBFS-Ordering in Asteroidal Triple-Free Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
LexBFS-Orderings and Power of Graphs
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
WG '01 Proceedings of the 27th 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
On linear and circular structure of (claw, net)-free graphs
Discrete Applied Mathematics
A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
Discrete Applied Mathematics
Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs
SIAM Journal on Discrete Mathematics
Lexbfs based recognition algorithms for cographs and related families
Lexbfs based recognition algorithms for cographs and related families
Journal of Computer and System Sciences
Information Processing Letters
Laminar structure of ptolemaic graphs with applications
Discrete Applied Mathematics
On end-vertices of Lexicographic Breadth First Searches
Discrete Applied Mathematics
A new approach to graph recognition and applications to distance-hereditary graphs
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A General Label Search to investigate classical graph search algorithms
Discrete Applied Mathematics
The LBFS Structure and Recognition of Interval Graphs
SIAM Journal on Discrete Mathematics
Laminar structure of ptolemaic graphs and its applications
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
The Journal of Machine Learning Research
| Hi-index | 0.00 |
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.