Decomposition of Directed Graphs
From MaRDI portal
Cites work
- A Combinatorial Decomposition Theory
- A Fast Algorithm for the Decomposition of Graphs and Posets
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- Graph derivatives
- Graph theory with applications
- scientific article; zbMATH DE number 3526726 (Why is no real title available?)
- On certain polytopes associated with graphs
- On the X-join decomposition for undirected graphs
Cited in
(only showing first 100 items - show all)- On an extension of distance hereditary graphs
- Treelike comparability graphs
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Decomposition of submodular functions
- A decomposition of distributive lattices
- An algorithm for minimizing setups in precedence constrained scheduling
- On finding the jump number of a partial order by substitution decomposition
- N-free posets as generalizations of series-parallel posets
- Isotropic systems
- On submodular function minimization
- Graphic presentations of isotropic systems
- Reducing prime graphs and recognizing circle graphs
- \(P_ 4\)-comparability graphs
- Representations of graphs and networks (coding, layouts and embeddings)
- \(P_ 4\)-trees and substitution decomposition
- Minimally 3-connected isotropic systems
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs
- On the closure of graphs under substitution
- PC trees and circular-ones arrangements.
- MAD trees and distance-hereditary graphs
- Distance labeling scheme and split decomposition
- The graph sandwich problem for 1-join composition is NP-complete
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
- Solving problems on graphs of high rank-width
- On complexities of minus domination
- Distance-hereditary comparability graphs
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- Basic perfect graphs and their extensions
- The sandwich problem for decompositions and almost monotone properties
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
- A 2-isomorphism theorem for delta-matroids
- Optimal centrality computations within bounded clique-width graphs
- Rank connectivity and pivot-minors of graphs
- Topology and counting of real algebraic curves
- 2-nested matrices: towards understanding the structure of circle graphs
- Grammars and clique-width bounds from split decompositions
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond
- Compositions for perfect graphs
- Some results on more flexible versions of Graph Motif
- Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter
- Isotropic matroids. III: Connectivity
- The rank-width of edge-coloured graphs
- Applying clique-decomposition for computing Gromov hyperbolicity
- A matrix description of weakly bipartitive and bipartitive families
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
- On polygon numbers of circle graphs and distance hereditary graphs
- \((\leq k)\)-reconstructible binary relations
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- Mutant knots and intersection graphs
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
- Recognizability, hypergraph operations, and logical types
- A contract-based model for directed network formation
- On computing the Gromov hyperbolicity
- Distance-hereditary comparability graphs
- Between treewidth and clique-width
- A BRACKET POLYNOMIAL FOR GRAPHS, III: VERTEX WEIGHTS
- Between treewidth and clique-width
- Using split composition to extend distance-hereditary graphs in a generative way (extended abstract)
- F-rank-width of (edge-colored) graphs
- Digraphs of bounded width
- A bracket polynomial for graphs. IV: Undirected Euler circuits, graph-links and multiply marked graphs
- Notes on a theorem of Naji
- Graph decompositions definable in monadic second-order logic
- The bi-join decomposition
- Solving problems on graphs of high rank-width
- Weighted interlace polynomials
- O(m n) split decomposition of strongly connected graphs
- Digraph Decompositions and Eulerian Systems
- Minimal strong digraphs
- Tree-representation of set families and applications to combinatorial decompositions
- Reduced clique graphs of chordal graphs
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- Polynomial-time recognition of clique-width 3 graphs
- Prechains and self duality
- A survey of the algorithmic aspects of modular decomposition
- Practical and efficient circle graph recognition
- Practical and efficient split decomposition via graph-labelled trees
- Scattered classes of graphs
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Matroids that classify forests
- scientific article; zbMATH DE number 7559376 (Why is no real title available?)
- The \(b\)-matching problem in distance-hereditary graphs and beyond
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- Bipartite graphs totally decomposable by canonical decomposition
- The external constraint 4 nonempty part sandwich problem
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- A Representation Theorem for Union-Difference Families and Application
- Graph isomorphism restricted by lists
- Graphs with bounded induced distance
- Domination graphs: Examples and counterexamples
- A polynomial kernel for 3-leaf power deletion
- From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals
- Circle graph isomorphism in almost linear time
- Partial characterizations of circle graphs
- F3-Reconstruction and Bi-Founded 2-Structures
- Vertex-minors of graphs: a survey
- Extending partial representations of circle graphs in near-linear time
- Hypergraphs with polynomial representation: introducing \(r\)-splits
This page was built for publication: Decomposition of Directed Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3960725)
