Parity Games on Undirected Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Information Processing Letters Year : 2012

Parity Games on Undirected Graphs

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 nodes of the two 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.
Fichier principal
Vignette du fichier
Parity-IPL.pdf (203.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01260646 , version 1 (22-01-2016)

Identifiers

Cite

Dietmar Berwanger, Olivier Serre. Parity Games on Undirected Graphs. Information Processing Letters, 2012, 112 (23), pp.5. ⟨10.1016/j.ipl.2012.08.021⟩. ⟨hal-01260646⟩
95 View
247 Download

Altmetric

Share

Gmail Facebook X LinkedIn More