Abstract
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. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Crespelle, C. (2010). Fully dynamic representations of interval graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5911 LNCS, pp. 77–87). https://doi.org/10.1007/978-3-642-11409-0_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
