Parameterized Algorithms for Parity Games
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F15%3A00081184" target="_blank" >RIV/00216224:14330/15:00081184 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-662-48054-0_28" target="_blank" >http://dx.doi.org/10.1007/978-3-662-48054-0_28</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-662-48054-0_28" target="_blank" >10.1007/978-3-662-48054-0_28</a>
Alternative languages
Result language
angličtina
Original language name
Parameterized Algorithms for Parity Games
Original language description
Determining the winner of a Parity Game is a major problem in computational complexity with a number of applications in verification. In a parameterized complexity setting, the problem has often been considered with parameters such as (directed versionsof) treewidth or clique-width, by applying dynamic programming techniques. In this paper we adopt a parameterized approach which is more inspired by well-known (non-parameterized) algorithms for this problem. We consider a number of natural parameterizations, such as by Directed Feedback Vertex Set, Distance to Tournament, and Modular Width. We show that, for these parameters, it is possible to obtain recursive parameterized algorithms which are simpler, faster and only require polynomial space. We complement these results with some algorithmic lower bounds which, among others, rule out a possible avenue for improving the best-known sub-exponential time algorithm for parity games.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
MFCS 2015, LNCS 9235
ISBN
9783662480533
ISSN
0302-9743
e-ISSN
—
Number of pages
12
Pages from-to
336-347
Publisher name
Springer
Place of publication
Berlin
Event location
Milano
Event date
Jan 1, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000371027300028