Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
type: Item
instance of: scholarly article
title: Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
zbMATH Open document ID: 1205.68258
author: Christophe Crespelle
author: Christophe Paul
published in: Algorithmica
publication date: 2010-09-16T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 5786341
zbMATH Keywords: dynamic algorithms
zbMATH Keywords: permutation graphs
zbMATH Keywords: modular decomposition
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W1996087362
cites work: Algorithms – ESA 2005
cites work: Graph Classes: A Survey
cites work: Algorithms and Computation
cites work: A Linear Recognition Algorithm for Cographs
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Fully dynamic recognition algorithm and certificate for directed cographs
cites work: On-Line Planarity Testing
cites work: An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
cites work: Separator-Based Sparsification II: Edge and Vertex Connectivity
cites work: Transitiv orientierbare Graphen
cites work: Q3328583
cites work: A Fully dynamic algorithm for recognizing and representing proper interval graphs
cites work: Q4252412
cites work: Q5501778
cites work: Modular decomposition and transitive orientation
cites work: Q3683903
cites work: Incremental modular decomposition
cites work: A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs
cites work: A fully dynamic algorithm for modular decomposition and recognition of cographs.
cites work: Efficient graph representations
cites work: Fast algorithms to enumerate all common intervals of two permutations
DOI: 10.1007/S00453-008-9273-0
Recommended article: Graph-Theoretic Concepts in Computer Science
Recommended article: A fully dynamic algorithm for modular decomposition and recognition of cographs.
Recommended article: Reconstruction Algorithm for Permutation Graphs
Recommended article: Q4331190
Recommended article: Q4390698
Recommended article: Fully dynamic algorithms for permutation graph coloring
Recommended article: A Fully Dynamic Algorithm for Recognizing and Representing Chordal Graphs
Recommended article: An Algorithm for the Modular Decomposition of Hypergraphs
description: scientific article; zbMATH DE number 5786341