Parity games on undirected graphs
From MaRDI portal
Publication:456183
Recommendations
Cites work
- A Deterministic Subexponential Algorithm for Solving Parity Games
- Automata, logics, and infinite games. A guide to current research
- Clique-Width and Parity Games
- DAG-Width and Parity Games
- Digraph measures: Kelly decompositions, games, and orderings
- Fast mu-calculus model checking when tree-width is bounded.
- Logic for Programming, Artificial Intelligence, and Reasoning
- Time and parallelizability results for parity games with bounded treewidth
- Undirected Graphs of Entanglement 2
Cited in
(11)- Parity in graph sharing games
- scientific article; zbMATH DE number 7533361 (Why is no real title available?)
- Foundations of Software Science and Computation Structures
- Generalized Parity Games
- Graph operations on parity games and polynomial-time algorithms
- Fatal Attractors in Parity Games
- scientific article; zbMATH DE number 7356850 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 6374006 (Why is no real title available?)
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)