Fully Dynamic Representations of Interval Graphs

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, and its modular decomposition. After each vertex or edge modification (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.

• Type: Conference
• Year: 2009
• Where: WG
• Authors: Christophe Crespelle
• Keywords: Computer Science, Dynamic Algorithm, Interval Graph, Minimal Interval Model, WG 2009