Clique-Width and Parity Games

DOI10.1007/978-3-540-74915-8_8zbMATH Open1179.68090OpenAlexW2145019049MaRDI QIDQ3608404FDOQ3608404

Authors: Jan Obdržálek 

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

Recommendations

• Parity games of bounded tree- and clique-width
• Parity Games on Graphs with Medium Tree-Width
• Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width
• Time and parallelizability results for parity games with bounded treewidth
• Parameterized Algorithms for Parity Games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43)

Cited In (19)

• Parity in graph sharing games
• The Complexity of Nash Equilibria in Infinite Multiplayer Games
• The Descriptive Complexity of Parity Games
• The dag-width of directed graphs
• Digraphs of Bounded Width
• The Theory of Universal Graphs for Infinite Duration Games
• Parity games on undirected graphs
• Solving parity games via priority promotion
• Graph operations on parity games and polynomial-time algorithms
• New deterministic algorithms for solving parity games
• Cliques and constructors in ``Hats game. II
• The mu-calculus and Model Checking
• Digraph width measures in parameterized algorithmics
• On digraph width measures in parameterized algorithmics
• The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
• Polynomial-time algorithms for energy games with special weight structures
• Parity Games on Graphs with Medium Tree-Width
• Parameterized Algorithms for Parity Games
• Alternating traps in Muller and parity games

This page was built for publication: Clique-Width and Parity Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608404)