Advertisement
Published in:
2005 | OriginalPaper | Chapter
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
Authors : Christophe Crespelle, Christophe Paul
Published in: Graph-Theoretic Concepts in Computer Science
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.