Clique-Width and Parity Games
From MaRDI portal
Publication:3608404
DOI10.1007/978-3-540-74915-8_8zbMath1179.68090OpenAlexW2145019049MaRDI QIDQ3608404
Publication date: 5 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74915-8_8
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (16)
The Theory of Universal Graphs for Infinite Duration Games ⋮ The mu-calculus and Model Checking ⋮ Alternating traps in Muller and parity games ⋮ Parameterized Algorithms for Parity Games ⋮ Graph operations on parity games and polynomial-time algorithms ⋮ The dag-width of directed graphs ⋮ Digraph width measures in parameterized algorithmics ⋮ Parity games on undirected graphs ⋮ The Descriptive Complexity of Parity Games ⋮ The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs ⋮ Polynomial-time algorithms for energy games with special weight structures ⋮ Solving parity games via priority promotion ⋮ New deterministic algorithms for solving parity games ⋮ The Complexity of Nash Equilibria in Infinite Multiplayer Games ⋮ On Digraph Width Measures in Parameterized Algorithmics ⋮ Digraphs of Bounded Width
This page was built for publication: Clique-Width and Parity Games
