An incremental linear-time algorithm for recognizing interval graphs
SIAM Journal on Computing
Simple linear time recognition of unit interval graphs
Information Processing Letters
Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
SIAM Journal on Computing
The ultimate interval graph recognition algorithm?
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
SIAM Journal on Computing
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
SIAM Journal on Computing
On-Line Recognition of Interval Graphs in O(m + nlog n) Time
Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Fully dynamic algorithms for chordal graphs and split graphs
ACM Transactions on Algorithms (TALG)
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
The clique-separator graph for chordal graphs
Discrete Applied Mathematics
A simple algorithm to find Hamiltonian cycles in proper interval graphs
Information Processing Letters
Journal of Computer and System Sciences
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
| Hi-index | 0.00 |
We present a fully dynamic graph algorithm to recognize proper interval graphs that runs in O (logn ) worst case time per edge update, where n is the number of vertices in the graph. The algorithm also maintains the connected components and supports connectivity queries in O (logn ) time.