Decomposition of Directed Graphs
From MaRDI portal
Publication:3960725
Cites work
- scientific article; zbMATH DE number 3526726 (Why is no real title available?)
- 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
- On certain polytopes associated with graphs
- On the X-join decomposition for undirected graphs
Cited in
(only showing first 100 items - show all)- Distance labeling scheme and split decomposition
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- \((\leq k)\)-reconstructible binary relations
- Some results on more flexible versions of Graph Motif
- Unavoidable vertex-minors in large prime graphs
- Practical and efficient split decomposition via graph-labelled trees
- Partial characterizations of circle graphs
- \(P_ 4\)-trees and substitution decomposition
- Graphs with bounded induced distance
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- On submodular function minimization
- scientific article; zbMATH DE number 7559376 (Why is no real title available?)
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- The external constraint 4 nonempty part sandwich problem
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
- Isotropic matroids. III: Connectivity
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Graphic presentations of isotropic systems
- Reducing prime graphs and recognizing circle graphs
- Isotropic systems
- Decomposition of partial orders
- Mutant knots and intersection graphs
- Circle graphs and monadic second-order logic
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- A 2-isomorphism theorem for delta-matroids
- On computing the Gromov hyperbolicity
- N-free posets as generalizations of series-parallel posets
- Clique-width of graphs defined by one-vertex extensions
- Decomposition of k-ary relations
- Polynomial-time recognition of clique-width \(\leq 3\) graphs
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- Digraph Decompositions and Eulerian Systems
- Weighted interlace polynomials
- A contract-based model for directed network formation
- Networks with small stretch number
- Prechains and self duality
- Diamond-free circle graphs are Helly circle
- Tree-representation of set families and applications to combinatorial decompositions
- Recognizing locally equivalent graphs
- On the closure of graphs under substitution
- Excluded vertex-minors for graphs of linear rank-width at most \(k\)
- A decomposition of distributive lattices
- \(P_ 4\)-comparability graphs
- Distance-hereditary comparability graphs
- PC trees and circular-ones arrangements.
- Enumerations, forbidden subgraph characterizations, and the split-decomposition
- Meta-kernelization with structural parameters
- Recognizability, hypergraph operations, and logical types
- Solving some NP-complete problems using split decomposition
- The rank-width of edge-coloured graphs
- Bipartite graphs totally decomposable by canonical decomposition
- Compositions for perfect graphs
- The graph sandwich problem for 1-join composition is NP-complete
- Isotropic matroids. I: Multimatroids and neighborhoods
- Splitting cubic circle graphs
- The bi-join decomposition
- MAD trees and distance-hereditary graphs
- Reduced clique graphs of chordal graphs
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Decomposition of submodular functions
- A Representation Theorem for Union-Difference Families and Application
- A BRACKET POLYNOMIAL FOR GRAPHS, III: VERTEX WEIGHTS
- Notes on a theorem of Naji
- A survey of the algorithmic aspects of modular decomposition
- The sandwich problem for decompositions and almost monotone properties
- Representations of graphs and networks (coding, layouts and embeddings)
- A polynomial kernel for 3-leaf power deletion
- Practical and efficient circle graph recognition
- Basic perfect graphs and their extensions
- On finding the jump number of a partial order by substitution decomposition
- Between treewidth and clique-width
- Solving problems on graphs of high rank-width
- Minimal strong digraphs
- Optimal centrality computations within bounded clique-width graphs
- Tree pivot-minors and linear rank-width
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond
- Between treewidth and clique-width
- On polygon numbers of circle graphs and distance hereditary graphs
- Matroids that classify forests
- An algorithm for minimizing setups in precedence constrained scheduling
- Word-representability of graphs with respect to split recomposition
- From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals
- Digraphs of bounded width
- \(\mathbb F\)-rank-width of (edge-colored) graphs
- Topology and counting of real algebraic curves
- F3-Reconstruction and Bi-Founded 2-Structures
- \(O(m \log n)\) split decomposition of strongly connected graphs
- Vertex-minors of graphs: a survey
- On an extension of distance hereditary graphs
- Extending partial representations of circle graphs in near-linear time
- Treelike comparability graphs
- Scattered classes of graphs
- Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter
- 2-nested matrices: towards understanding the structure of circle graphs
- Rank connectivity and pivot-minors of graphs
- Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs
- Domination graphs: Examples and counterexamples
- Applying clique-decomposition for computing Gromov hyperbolicity
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)
