Sciweavers

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

14

WG
2009
Springer

favoriteEmaildiscussreport

153views Theoretical Computer Science» more WG 2009»

Fully Dynamic Representations of Interval Graphs

13 years 11 months ago

Fully Dynamic Representations of Interval Graphs

Download www-npa.lip6.fr

We present a fully dynamic algorithm that maintains three diﬀerent representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques, and its modular decomposition. After each vertex or edge modiﬁcation (insertion or deletion), the algorithm determines whether the new graph is an interval graph in O(n) time, and, in the positive, updates the three representations within the same complexity.

Christophe Crespelle

Real-time Traffic

Computer Science | Dynamic Algorithm | Interval Graph | Minimal Interval Model | WG 2009 |

claim paper

Related Content

» A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs

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

» Fully dynamic algorithms for chordal graphs and split graphs

» A parallel algorithm for dynamic slicing of distributed Java programs in nonDSM systems

» A Distributed Prime Sieving Algorithm based on Scheduling by Multiple Edge Reversal

» Cerebral Visualizing Multiple Experimental Conditions on a Graph with Biological Context

» Realms A Foundation for Spatial Data Types in Database Systems

» Odefy From discrete to continuous models

Post Info
More Details (n/a)

Added	25 May 2010
Updated	25 May 2010
Type	Conference
Year	2009
Where	WG
Authors	Christophe Crespelle

Comments (0)