The following pages link to DAG-width (Q3581553):
Displaying 36 items.
- Jumping robbers in digraphs (Q343927) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- Forbidden directed minors and Kelly-width (Q501668) (← links)
- Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301) (← links)
- Directed width parameters and circumference of digraphs (Q730003) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Monotonicity of non-deterministic graph searching (Q930888) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Digraph searching, directed vertex separation and directed pathwidth (Q944735) (← links)
- On complexity of minimum leaf out-branching problem (Q967352) (← links)
- Recognizing digraphs of Kelly-width 2 (Q972333) (← links)
- Entanglement and the complexity of directed graphs (Q1929212) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- An extended tree-width notion for directed graphs related to the computation of permanents (Q2254501) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- Complexity of node coverage games (Q2344734) (← links)
- Monotonicity of strong searching on digraphs (Q2426650) (← links)
- Digraphs of bounded elimination width (Q2442210) (← links)
- Are There Any Good Digraph Width Measures? (Q3058698) (← links)
- LIFO-Search on Digraphs: A Searching Game for Cycle-Rank (Q3088285) (← links)
- A Polynomial Time Algorithm for Bounded Directed Pathwidth (Q3104788) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Monotonicity of Non-deterministic Graph Searching (Q3508552) (← links)
- Characterization and Recognition of Digraphs of Bounded Kelly-width (Q3508574) (← links)
- Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302) (← links)
- The Descriptive Complexity of Parity Games (Q3540190) (← links)
- On Digraph Width Measures in Parameterized Algorithmics (Q3656861) (← links)
- (Q5090497) (← links)
- Directed Path-Decompositions (Q5215903) (← links)
- Digraph Decompositions and Monotonicity in Digraph Searching (Q5302067) (← links)
- The Complexity of Nash Equilibria in Infinite Multiplayer Games (Q5458348) (← links)
- (Q5743498) (← links)
