Search

• < Previous
• 1
• Next >

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

Parity games are a much researched class of games in NP intersect CoNP that are not known to be in P. Consequently, researchers have considered specialised algorithms for the case where certain graph parameters are small. In this paper, we study parity games on graphs with bounded treewidth, and&nbsp;[&hellip;]