Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

ALGORITHMICA
2010

favoriteEmaildiscussreport

137views more ALGORITHMICA 2010»

A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs

13 years 4 months ago

A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs

Download facweb.cs.depaul.edu

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

Real-time Traffic

ALGORITHMICA 2010 | Dynamic Graph Algorithm | Interval Graphs | Train Tree |

claim paper

Related Content

» Fully Dynamic Representations of Interval Graphs

» Recognizing dInterval Graphs and dTrack Interval Graphs

» Certifying algorithms for recognizing interval graphs and permutation graphs

» Recognizing and representing proper interval graphs in parallel using merging and sorting

» Fully dynamic algorithms for chordal graphs and split graphs

» Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs

» Certificates and Fast Algorithms for Biconnectivity in FullyDynamic Graphs

» A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs

» Complexity and exact algorithms for vertex multicut in interval and bounded treewidth grap...

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2010
Where	ALGORITHMICA
Authors	Louis Ibarra

Comments (0)