Digraphs of bounded width
From MaRDI portal
Recommendations
Cites work
- \(k\)-NLC graphs and polynomial algorithms
- A combinatorial problem; stability and order for models and theories in infinitary languages
- A Parametrized Algorithm for Matroid Branch-Width
- A Polynomial Time Algorithm for Bounded Directed Pathwidth
- A trichotomy for regular simple path queries on graphs
- A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
- An algorithmic metatheorem for directed treewidth
- An annotated bibliography on guaranteed graph searching
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
- Approximating clique-width and branch-width
- Approximating rank-width and clique-width quickly
- Approximation algorithms for digraph width parameters
- Are there any good digraph width measures?
- Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
- Characterising bounded expansion by neighbourhood complexity
- Clique-Width and Parity Games
- Colouring graphs with bounded generalized colouring number
- Complement reducible graphs
- Complexity of Finding Embeddings in a k-Tree
- Computing directed pathwidth in O(1.89ⁿ) time
- Constant-factor approximation of the domination number in sparse graphs
- DAG-width
- DAG-width and circumference of digraphs
- DAG-Width and Parity Games
- Decomposition of Directed Graphs
- Digraph decompositions and monotonicity in digraph searching
- Digraph measures: Kelly decompositions, games, and orderings
- Digraph width measures in parameterized algorithmics
- Digraphs of bounded elimination width
- Directed NLC-width
- Directed nowhere dense classes of graphs
- Directed path-width and monotonicity in digraph searching
- Directed rank-width and displit decomposition
- Directed tree-width
- Directed tree-width examples
- Directed width parameters and circumference of digraphs
- Disjoint paths in tournaments
- Edge dominating set and colorings on graphs with fixed clique-width
- Edge-disjoint paths in digraphs with bounded independence number
- Entanglement and the complexity of directed graphs
- Finding Branch-Decompositions and Rank-Decompositions
- Forbidden directed minors and Kelly-width
- Grad and classes with bounded expansion. I: Decompositions
- Graph minors. V. Excluding a planar graph
- Graph minors. X: Obstructions to tree-decomposition
- Graph searching and a min-max theorem for tree-width
- Graph searching games
- Graph searching games and width measures for directed graphs
- Graph structure and monadic second-order logic. A language-theoretic approach
- Graphic presentations of isotropic systems
- Half-integral linkages in highly connected directed graphs
- Handle-rewriting hypergraph grammars
- scientific article; zbMATH DE number 15493 (Why is no real title available?)
- scientific article; zbMATH DE number 53949 (Why is no real title available?)
- scientific article; zbMATH DE number 1057879 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 2044928 (Why is no real title available?)
- Intractability of clique-width parameterizations
- Introducing directed tree width
- Isotropic systems
- Jungles, bundles, and fixed-parameter tractability
- Linear time solvable optimization problems on graphs of bounded clique-width
- Logic for Programming, Artificial Intelligence, and Reasoning
- Mathematical Foundations of Computer Science 2005
- Monotonicity in graph searching
- On digraph width measures in parameterized algorithmics
- On nowhere dense graphs
- On the density of families of sets
- On the structure of graphs with path-width at most two
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Orderings on graphs and game coloring number
- Packing directed circuits
- Parameterized tractability of edge-disjoint paths on directed acyclic graphs
- Parametrized complexity theory.
- Polynomial-time recognition of clique-width 3 graphs
- Rank-width and vertex-minors
- Rank-Width and Well-Quasi-Ordering
- Rank-width: algorithmic and structural results
- Recognizing digraphs of Kelly-width 2
- Reducing prime graphs and recognizing circle graphs
- Searching and sweeping graphs: a brief survey
- Structural properties and constant factor-approximation of strong distance-r dominating sets in sparse directed graphs
- The dag-width of directed graphs
- The directed grid theorem
- The directed subgraph homeomorphism problem
- The rank-width of edge-coloured graphs
- The rank-width of the square grid
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs
Cited in
(11)- On the girth of digraphs
- Digraphs of directed treewidth one
- Forbidden directed minors, directed path-width and directed tree-width of tree-like digraphs
- Comparing linear width parameters for directed graphs
- Are there any good digraph width measures?
- Synchronizing series-parallel deterministic finite automata with loops and related problems
- Directed path-decompositions
- Mathematical Foundations of Computer Science 2005
- Spined categories: generalizing tree-width beyond graphs
- Dualities in graphs and digraphs
- Are there any good digraph width measures?
This page was built for publication: Digraphs of bounded width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3120441)
