Time and Parallelizability Results for Parity Games with Bounded Treewidth

DOI10.1007/978-3-642-31585-5_20zbMath1367.68108OpenAlexW1562413306MaRDI QIDQ3167011

Sven Schewe, John Fearnley

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43)

Related Items (4)

Graph operations on parity games and polynomial-time algorithms ⋮ Parity games on undirected graphs ⋮ Solving parity games via priority promotion ⋮ New deterministic algorithms for solving parity games

This page was built for publication: Time and Parallelizability Results for Parity Games with Bounded Treewidth