3 search results - page 1 / 1 » Fully Dynamic Algorithm for Recognition and Modular Decompos... |
WG
2005
Springer
14 years 8 days 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...
DAM
2006
13 years 6 months ago
2006
This paper presents an optimal fully dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc ...
WG
2009
Springer
14 years 1 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...