Parity games on undirected graphs

Authors:
Dietmar Berwanger;Olivier Serre
Affiliations:
LSV, ícole Normale Supérieure de Cachan & CNRS, France;LIAFA, Université Paris Diderot, Paris 7 & CNRS, France
Venue:
Information Processing Letters
Year:
2012

Citing 8
Cited 0

Tree automata, Mu-Calculus and determinacy

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Trees, automata, and games

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Digraph measures: Kelly decompositions, games, and orderings

Theoretical Computer Science
A Deterministic Subexponential Algorithm for Solving Parity Games

SIAM Journal on Computing
Undirected graphs of entanglement 2

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
DAG-Width and parity games

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Time and parallelizability results for parity games with bounded treewidth

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Clique-width and parity games

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

Quantified Score

Hi-index	0.89

Visualization

Abstract

We examine the complexity of solving parity games in the special case when the underlying game graph is undirected. For strictly alternating games, that is, when the game graph is bipartite between the players, we observe that the solution can be computed in linear time. In contrast, when the assumption of strict alternation is dropped, we show that the problem is as hard in the undirected case as it is in the general, directed, case.