The problem of dynamically recognizing a graph property calls for efficiently deciding if an input graph satisfies the property under repeated modifications to its set of vertices and edges. The input to the problem consists of a series of modifications to be performed on the graph. The objective is to maintain a representation of the graph as long as the property holds, and to detect when it ceases to hold. In this paper, we solve the dynamic recognition problem for the class of cographs and some of its subclasses. Our approach is based on maintaining the modular decomposition tree of the dynamic graph, and using this tree for the recognition. We give the first fully dynamic algorithm for maintaining the modular decomposition tree of a cograph. We thereby obtain fully dynamic algorithms for the recognition of cographs, threshold graphs, and trivially perfect graphs. All these algorithms work in constant time per edge modification and O(d) time per d-degree vertex modification.
|Number of pages||12|
|Journal||Discrete Applied Mathematics|
|State||Published - 15 Feb 2004|
|Event||1st Cologne-Twente Workshop on Graphs and Combinatorial (CTW 2001) - Enschede, Netherlands|
Duration: 6 Jun 2001 → 8 Jun 2001
- Fully dynamic algorithm
- Modular decomposition