Sciweavers

Share
ALGORITHMICA
2010

A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs

9 years 1 months ago
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the number of vertices in the graph. The algorithm uses a new representation of interval graphs called the train tree, which is based on the clique-separator graph representation of chordal graphs. The train tree has a number of useful properties and it can be constructed from the clique-separator graph in O(n) time.
Louis Ibarra
Added 08 Dec 2010
Updated 08 Dec 2010
Type Journal
Year 2010
Where ALGORITHMICA
Authors Louis Ibarra
Comments (0)
books