Linear-time modular decomposition of directed graphs
From MaRDI portal
Recommendations
- Algorithm Theory - SWAT 2004
- scientific article; zbMATH DE number 1003286
- Efficient and practical algorithms for sequential modular decomposition
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time
- Modular decomposition and transitive orientation
Cites work
- scientific article; zbMATH DE number 1003286 (Why is no real title available?)
- 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 1375569 (Why is no real title available?)
- scientific article; zbMATH DE number 1741000 (Why is no real title available?)
- scientific article; zbMATH DE number 1753166 (Why is no real title available?)
- scientific article; zbMATH DE number 1456953 (Why is no real title available?)
- P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
- An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
- Complement reducible graphs
- Efficient and practical algorithms for sequential modular decomposition
- Graph Classes: A Survey
- Introduction to algorithms
- Modular decomposition and transitive orientation
- Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
- Partitive hypergraphs
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Theory of 2-structures. I: Clans, basic subclasses, and morphisms
- Theory of 2-structures. II: Representation through labeled tree families
- Three Partition Refinement Algorithms
- Transitiv orientierbare Graphen
- \(P_ 4\)-trees and substitution decomposition
Cited in
(23)- A distance measure for large graphs based on prime graphs
- Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- Decomposition tree of a lexicographic product of binary structures
- An Algorithm for the Modular Decomposition of Hypergraphs
- Reconstructing gene trees from Fitch's xenology relation
- An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
- Fitch graph completion
- The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
- A graph isomorphism condition and equivalence of reaction systems
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters
- Deterministic Algorithms for the Independent Feedback Vertex Set Problem
- Simple extensions of combinatorial structures
- Tournaments without acyclic interval.
- Kernels for feedback arc set in tournaments
- Algorithmic aspects of a general modular decomposition theory
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time
- Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs
- Hierarchical and modularly-minimal vertex colorings
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
- Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
- scientific article; zbMATH DE number 219269 (Why is no real title available?)
This page was built for publication: Linear-time modular decomposition of directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1764805)
