Clique-Width and Parity Games
From MaRDI portal
Publication:3608404
DOI10.1007/978-3-540-74915-8_8zbMath1179.68090MaRDI 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
68Q25: Analysis of algorithms and problem complexity
91A43: Games involving graphs
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
The Theory of Universal Graphs for Infinite Duration Games, The Complexity of Nash Equilibria in Infinite Multiplayer Games, Alternating traps in Muller and parity games, The dag-width of directed graphs, Parity games on undirected graphs, The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs, Polynomial-time algorithms for energy games with special weight structures, Graph operations on parity games and polynomial-time algorithms, Solving parity games via priority promotion, New deterministic algorithms for solving parity games, Digraph width measures in parameterized algorithmics, Parameterized Algorithms for Parity Games, Digraphs of Bounded Width, The mu-calculus and Model Checking, The Descriptive Complexity of Parity Games, On Digraph Width Measures in Parameterized Algorithmics
