Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs

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 representation allows us to answer adjacency queries in O(1) time. The approach is based on a fully dynamic modular decomposition algorithm for permutation graphs that works in O(n) time per edge and vertex modification. We thereby obtain a fully dynamic algorithm for the recognition of permutation graphs.

• Type: Conference
• Year: 2005
• Where: WG
• Authors: Christophe Crespelle, Christophe Paul
• Keywords: Compact Representation, Computer Science, Dynamic Modular Decomposition, Permutation Graphs, WG 2005