Parity games on undirected graphs
DOI10.1016/J.IPL.2012.08.021zbMATH Open1248.68234OpenAlexW2046760938MaRDI QIDQ456183FDOQ456183
Authors: 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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Games involving graphs (91A43)
Cites Work
- Logic for Programming, Artificial Intelligence, and Reasoning
- Digraph measures: Kelly decompositions, games, and orderings
- Automata, logics, and infinite games. A guide to current research
- A Deterministic Subexponential Algorithm for Solving Parity Games
- DAG-Width and Parity Games
- Fast mu-calculus model checking when tree-width is bounded.
- Clique-Width and Parity Games
- Time and parallelizability results for parity games with bounded treewidth
- Undirected Graphs of Entanglement 2
Cited In (11)
- Parity in graph sharing games
- Foundations of Software Science and Computation Structures
- Generalized Parity Games
- Graph operations on parity games and polynomial-time algorithms
- Fatal Attractors in Parity Games
- Title not available (Why is that?)
- Parity games with partial information played on graphs of bounded complexity
- The mu-calculus and Model Checking
- Parity Games on Graphs with Medium Tree-Width
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Parity games on undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456183)
