Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Victor Lage Pessoa"'
Publikováno v:
Theoretical Computer Science. :36-45
In this paper, we answer a long-standing open question proposed by Bodlaender in 1991: the game chromatic number is PSPACE-hard. We also prove that the game Grundy number is PSPACE-hard. In fact, we prove that both problems (the graph coloring game a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e059d660ab7fa4c6576dc5abbff4f3f3
https://doi.org/10.1016/j.tcs.2020.03.022
https://doi.org/10.1016/j.tcs.2020.03.022
Publikováno v:
LAGOS
In this paper, we answer a long-standing open question proposed by Bodlaender in 1991: the game chromatic number is PSPACE-hard. We also prove that the game Grundy number is PSPACE-hard. In fact, we prove that both problems (the graph coloring game a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::914b5f9aa1fb11bf177e24edf7ea5d13
https://doi.org/10.1016/j.entcs.2019.08.030
https://doi.org/10.1016/j.entcs.2019.08.030