Time and Parallelizability Results for Parity Games with Bounded Treewidth
From MaRDI portal
Publication:3167011
DOI10.1007/978-3-642-31585-5_20zbMath1367.68108MaRDI QIDQ3167011
Publication date: 1 November 2012
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31585-5_20
Related Items
Parity games on undirected graphs, Graph operations on parity games and polynomial-time algorithms, Solving parity games via priority promotion, New deterministic algorithms for solving parity games