The following pages link to DAG-Width and Parity Games (Q5449827):
Displaying 50 items.
- Solving parity games in big steps (Q340584) (← links)
- Jumping robbers in digraphs (Q343927) (← links)
- Alternating traps in Muller and parity games (Q389948) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- Parity games on undirected graphs (Q456183) (← links)
- Finding a subdivision of a digraph (Q476873) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- Forbidden directed minors and Kelly-width (Q501668) (← links)
- First-cycle games (Q528186) (← links)
- Minimal equivalent subgraphs containing a given set of arcs (Q528495) (← 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)
- The Rabin index of parity games: its complexity and approximation (Q897647) (← links)
- Graph operations on parity games and polynomial-time algorithms (Q906273) (← 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)
- Solving parity games via priority promotion (Q1742991) (← links)
- New deterministic algorithms for solving parity games (Q1756345) (← links)
- Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
- Entanglement and the complexity of directed graphs (Q1929212) (← links)
- Directed width parameters on semicomplete digraphs (Q2150583) (← 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)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← 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)
- From Parity and Payoff Games to Linear Programming (Q3182965) (← links)
- Symmetric Strategy Improvement (Q3449491) (← 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)
- Polynomial-Time Under-Approximation of Winning Regions in Parity Games (Q4982057) (← links)
- (Q5015265) (← links)
- (Q5089244) (← links)
- (Q5090497) (← links)
