71 search results - page 7 / 15 » Clique-Width and Parity Games |
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
CSL
2008
Springer
13 years 8 months ago
2008
Springer
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...
MFCS
2009
Springer
14 years 1 months ago
2009
Springer
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
DAGSTUHL
2001
13 years 8 months ago
2001