DAG-width
From MaRDI portal
Cited in
(42)- Entanglement and the complexity of directed graphs
- How to compute digraph width measures on directed co-graphs
- An extended tree-width notion for directed graphs related to the computation of permanents
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Complexity of node coverage games
- Monotonicity of strong searching on digraphs
- Digraphs of bounded elimination width
- Are there any good digraph width measures?
- LIFO-search on digraphs: a searching game for cycle-rank
- A Polynomial Time Algorithm for Bounded Directed Pathwidth
- Digraphs of bounded width
- Jumping robbers in digraphs
- Monotonicity of Non-deterministic Graph Searching
- Characterization and Recognition of Digraphs of Bounded Kelly-width
- Finite Automata, Digraph Connectivity, and Regular Expression Size
- The Descriptive Complexity of Parity Games
- On digraph width measures in parameterized algorithmics
- The dag-width of directed graphs
- On the algorithmic effectiveness of digraph decompositions and complexity measures
- Approximation algorithms for digraph width parameters
- Forbidden directed minors and Kelly-width
- Algorithmic properties of sparse digraphs
- Directed path-decompositions
- Digraph Decompositions and Monotonicity in Digraph Searching
- The Complexity of Nash Equilibria in Infinite Multiplayer Games
- Directed nowhere dense classes of graphs
- Digraph decompositions and monotonicity in digraph searching
- A cops and robber game and the meeting time of synchronous directed walks
- Hunting a rabbit is hard
- Complexity results for a cops and robber game on directed graphs
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
- Hunting a rabbit: complexity, approximability and some characterizations
- Monotonicity of the cops and robber game for bounded depth treewidth
- Sparsification of directed graphs via cut balance
- Directed width parameters and circumference of digraphs
- Are there any good digraph width measures?
- Monotonicity of non-deterministic graph searching
- Digraph measures: Kelly decompositions, games, and orderings
- An annotated bibliography on guaranteed graph searching
- Digraph searching, directed vertex separation and directed pathwidth
- On complexity of minimum leaf out-branching problem
- Recognizing digraphs of Kelly-width 2
This page was built for publication: DAG-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581553)
