9 search results - page 1 / 2 » Fully Dynamic Representations of Interval Graphs |
WG
2009
Springer
13 years 11 months ago
2009
Springer
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
ALGORITHMICA
2010
13 years 5 months ago
2010
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 ...
WG
2005
Springer
13 years 10 months ago
2005
Springer
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
TALG
2008
13 years 4 months ago
2008
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
IJICT
2007
13 years 4 months ago
2007
We propose a parallel algorithm for dynamic slicing of distributed Java programs. Given a distributed Java program, we first construct an intermediate representation in the form o...