An O(n2)-time algorithm for the minimal interval completion problem
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
A fully dynamic algorithm for the recognition of P4-sparse graphs
Theoretical Computer Science
Survey: A survey of the algorithmic aspects of modular decomposition
Computer Science Review
Normal Helly circular-arc graphs and its subclasses
Discrete Applied Mathematics
An O( n2)-time algorithm for the minimal interval completion problem
Theoretical Computer Science
| Hi-index | 0.00 |
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.