The following pages link to Clique-Width and Parity Games (Q3608404):
Displaying 13 items.
- Alternating traps in Muller and parity games (Q389948) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- Parity games on undirected graphs (Q456183) (← links)
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs (Q477199) (← links)
- Polynomial-time algorithms for energy games with special weight structures (Q487011) (← links)
- Graph operations on parity games and polynomial-time algorithms (Q906273) (← links)
- Solving parity games via priority promotion (Q1742991) (← links)
- New deterministic algorithms for solving parity games (Q1756345) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Parameterized Algorithms for Parity Games (Q2946404) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- The Theory of Universal Graphs for Infinite Duration Games (Q5043588) (← links)
