The dag-width of directed graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Alternation
- Clique-Width and Parity Games
- Complexity of Finding Embeddings in a k-Tree
- DAG-Width and Parity Games
- DAG-width
- Digraph Decompositions and Monotonicity in Digraph Searching
- Digraph measures: Kelly decompositions, games, and orderings
- Directed path-width and monotonicity in digraph searching
- Directed tree-width
- Directed tree-width examples
- Fast mu-calculus model checking when tree-width is bounded.
- Fugitive-search games on graphs and related parameters
- Graph minors. III. Planar tree-width
- Graph searching and a min-max theorem for tree-width
- Introducing directed tree width
- Logic for Programming, Artificial Intelligence, and Reasoning
- Mathematical Foundations of Computer Science 2005
- On model checking for the \(\mu\)-calculus and its fragments
- Results on the propositional \(\mu\)-calculus
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- Searching and pebbling
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
Cited in
(43)- The localization game on oriented graphs
- Parameterized Algorithms for Parity Games
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- DAG-width is PSPACE-complete
- Jumping robbers in digraphs
- DAG-width and circumference of digraphs
- Directed width parameters on semicomplete digraphs
- Computing the zig-zag number of directed graphs
- Digraphs of bounded width
- Directed path-decompositions
- Digraph width measures in parameterized algorithmics
- Directed tree-width
- On directed covering and domination problems
- Digraph coloring and distance to acyclicity
- On the structure of solution-sets to regular word equations
- Directed NLC-width
- Directed tree-width examples
- scientific article; zbMATH DE number 7378361 (Why is no real title available?)
- Spined categories: generalizing tree-width beyond graphs
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- How to compute digraph width measures on directed co-graphs
- Directed elimination games
- Graph searching games and width measures for directed graphs
- Directed width parameters and circumference of digraphs
- On the hardness of finding near-optimal multicuts in directed acyclic graphs
- DAG-Width and Parity Games
- Digraphs of bounded elimination width
- Are there any good digraph width measures?
- Width-restricted layering of acyclic digraphs with consideration of dummy nodes
- Redicolouring digraphs: directed treewidth and cycle-degeneracy
- On the complexity of directed intersection representation of DAGs
- Congestion-free rerouting of flows on DAGs
- On width measures and topological problems on semi-complete digraphs
- Forbidden directed minors and Kelly-width
- On directed covering and domination problems
- A linear-time parameterized algorithm for computing the width of a DAG
- An algorithmic metatheorem for directed treewidth
- Entanglement and the complexity of directed graphs
- On the monotonicity of process number
- Digraph decompositions and monotonicity in digraph searching
- Approximation algorithms for digraph width parameters
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
- The complexity of optimizing atomic congestion
This page was built for publication: The dag-width of directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444380)
