Efficient and practical algorithms for sequential modular decomposition
From MaRDI portal
Recommendations
Cited in
(48)- Transitive orientations in bull-reducible Berge graphs
- On transitive orientations with restricted covering graphs
- Incremental modular decomposition
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
- Cograph editing: Merging modules is equivalent to editing P₄s
- An efficient exact algorithm for triangle listing in large graphs
- Graphs of linear clique-width at most 3
- On variations of \(P_{4}\)-sparse graphs
- Recognition of chordal graphs and cographs which are cover-incomparability graphs
- Algorithm Theory - SWAT 2004
- An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
- Solving NP-hard problems on \textsc{GaTEx} graphs: linear-time algorithms for perfect orderings, cliques, colorings, and independent sets
- Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs
- Structure and stability number of chair-, co-P- and gem-free graphs revisited
- On the structure of (\(P_{5}\),\,gem)-free graphs
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- A fully dynamic algorithm for the recognition of P₄-sparse graphs
- Graph Drawing
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Linear-time modular decomposition of directed graphs
- Verifying the product of generalized Boolean matrix multiplication and its applications to detect small subgraphs
- On algorithms for (P₅, gem)-free graphs
- scientific article; zbMATH DE number 1508917 (Why is no real title available?)
- The pair completion algorithm for the homogeneous set sandwich problem
- Applying modular decomposition to parameterized cluster editing problems
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
- Efficient parallel modular decomposition (extended abstract)
- A survey of the algorithmic aspects of modular decomposition
- On the parallel computation of the biconnected and strongly connected co-components of graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- Drawing graphs using modular decomposition
- Probe threshold and probe trivially perfect graphs
- Algorithmic aspects of a general modular decomposition theory
- Minimal separators in \(P_4\)-sparse graphs
- The possible cardinalities of global secure sets in cographs
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
- Approximating modular decomposition is hard
- Matching cutsets in graphs of diameter 2
- Neighborhood covering and independence on P₄-tidy graphs and tree-cographs
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
- A linear algorithm to decompose inheritance graphs into modules
- Nesting of prime substructures in k-ary relations
- A simple linear time algorithm for cograph recognition
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
- On Indecomposability Preserving Elimination Sequences
- Clique-perfectness and balancedness of some graph classes
- Single machine scheduling with precedence constraints and positionally dependent processing times
This page was built for publication: Efficient and practical algorithms for sequential modular decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2775895)
