Fully dynamic algorithm for recognition and modular decomposition of permutation graphs

Authors:
Christophe Crespelle;Christophe Paul
Affiliations:
CnRS – Département Informatique, LIRMM, Montpellier;CnRS – Département Informatique, LIRMM, Montpellier
Venue:
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Year:
2005

Citing 6
Cited 5

Incremental modular decomposition

Journal of the ACM (JACM)
Graph classes: a survey

Graph classes: a survey
Fully dynamic algorithms for chordal graphs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs

SIAM Journal on Computing
A fully dynamic algorithm for modular decomposition and recognition of cographs

Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Fully-Dynamic recognition algorithm and certificate for directed cographs

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

Fully dynamic recognition algorithm and certificate for directed cograph

Discrete Applied Mathematics
Dynamically maintaining split graphs

Discrete Applied Mathematics
An optimal, edges-only fully dynamic algorithm for distance-hereditary graphs

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Dynamic distance hereditary graphs using split decomposition

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A fully dynamic algorithm for the recognition of P4-sparse graphs

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.