Parity games on undirected graphs

DOI10.1016/J.IPL.2012.08.021zbMath1248.68234OpenAlexW2046760938MaRDI QIDQ456183

Dietmar Berwanger, Olivier Serre

Publication date: 23 October 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01260646/file/Parity-IPL.pdf

zbMATH Keywords

parity gamesgraph algorithmsgraph structure complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

The mu-calculus and Model Checking

Cites Work

• Digraph measures: Kelly decompositions, games, and orderings
• Automata, logics, and infinite games. A guide to current research
• Time and Parallelizability Results for Parity Games with Bounded Treewidth
• A Deterministic Subexponential Algorithm for Solving Parity Games
• Clique-Width and Parity Games
• DAG-Width and Parity Games
• Undirected Graphs of Entanglement 2
• Logic for Programming, Artificial Intelligence, and Reasoning
• Computer Aided Verification

This page was built for publication: Parity games on undirected graphs