Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
From MaRDI portal
(Redirected from Publication:5961976)
Recommendations
- Graph-Theoretic Concepts in Computer Science
- A fully dynamic algorithm for modular decomposition and recognition of cographs.
- Reconstruction Algorithm for Permutation Graphs
- scientific article; zbMATH DE number 1741000
- scientific article; zbMATH DE number 1156661
- Fully dynamic algorithms for permutation graph coloring
- A fully dynamic algorithm for recognizing and representing chordal graphs
- An Algorithm for the Modular Decomposition of Hypergraphs
Cites work
- A fully dynamic algorithm for modular decomposition and recognition of cographs.
- A Fully dynamic algorithm for recognizing and representing proper interval graphs
- A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs
- A Linear Recognition Algorithm for Cographs
- Algorithms – ESA 2005
- Algorithms and Computation
- An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
- Efficient graph representations
- Fast algorithms to enumerate all common intervals of two permutations
- Fully dynamic recognition algorithm and certificate for directed cographs
- Graph Classes: A Survey
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- scientific article; zbMATH DE number 1305520 (Why is no real title available?)
- scientific article; zbMATH DE number 6472574 (Why is no real title available?)
- Incremental modular decomposition
- Modular decomposition and transitive orientation
- On-Line Planarity Testing
- Separator-Based Sparsification II: Edge and Vertex Connectivity
- Transitiv orientierbare Graphen
Cited in
(20)- A fully dynamic algorithm for modular decomposition and recognition of cographs.
- Fully dynamic representations of interval graphs
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem
- A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
- Fully dynamic recognition of proper circular-arc graphs
- Fully dynamic recognition algorithm and certificate for directed cographs
- Complete edge-colored permutation graphs
- Succinct permutation graphs
- An \(\mathcal {O}(n^2)\) time algorithm for the minimal permutation completion problem
- Fully dynamic algorithms for permutation graph coloring
- A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs
- Permutation bigraphs and interval containments
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- A fully dynamic algorithm for the recognition of P₄-sparse graphs
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
- Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs
- Characterization and enumeration of 3-regular permutation graphs
- Title not available (Why is no real title available?)
This page was built for publication: Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961976)
