Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width

DOI10.2168/LMCS-9(2:6)2013zbMath1266.68123arXiv1112.0221MaRDI QIDQ4927428

John Fearnley, Sven Schewe

Publication date: 20 June 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.0221

zbMATH Keywords

parity gamestreewidth

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Solving parity games in big steps ⋮ Unnamed Item

This page was built for publication: Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width