Parity Games of Bounded Tree- and Clique-Width


In this paper it is shown that deciding the winner of a parity game is in LogCFL, if the underlying graph has bounded tree-width, and in LogDCFL, if the tree-width is at most 2. It is also proven that parity games of bounded clique-width can be solved in LogCFL via a log-space reduction to the bounded tree-width case, assuming that a k-expression for the… (More)
DOI: 10.1007/978-3-662-46678-0_25


4 Figures and Tables

Slides referencing similar topics