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
SIAM Journal on Discrete Mathematics
Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
SIAM Journal on Computing
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
A Simple Test for Interval Graphs
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
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
PC trees and circular-ones arrangements
Theoretical Computer Science - Computing and combinatorics
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
Discrete Applied Mathematics
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
SIAM Journal on Computing
A Simple Linear Time LexBFS Cograph Recognition Algorithm
SIAM Journal on Discrete Mathematics
On end-vertices of Lexicographic Breadth First Searches
Discrete Applied Mathematics
Journal of Computer and System Sciences
Lexicographic breadth first search – a survey
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
A graph is an interval graph if it is the intersection graph of intervals on a line. Interval graphs are known to be the intersection of chordal graphs and asteroidal triple-free graphs, two families where the well-known lexicographic breadth first search (LBFS) plays an important algorithmic and structural role. In this paper we show that interval graphs have a very rich LBFS structure and that by exploiting this structure one can design a linear time, easily implementable, interval graph recognition algorithm.