Geodesic
How Bad is the Freedom to Flood-It?
Journal of Graph Algorithms and Applications, Tome 23 (2019) no. 2, pp. 111-134.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

${\rm F{\small IXED-}F{\small LOOD-}I{\small T}}$ and ${\rm F{\small REE-}F{\small LOOD-}I{\small T}}$ are combinatorial problems on graphs that generalize a very popular puzzle called Flood-It. Both problems consist of recoloring moves whose goal is to produce a monochromatic ("flooded") graph as quickly as possible. Their difference is that in ${\rm F{\small REE-}F{\small LOOD-}I{\small T}}$ the player has the additional freedom of choosing the vertex to play in each move. In this paper, we investigate how this freedom affects the complexity of the problem. It turns out that the freedom is bad in some sense. We show that some cases trivially solvable for ${\rm F{\small IXED-}F{\small LOOD-}I{\small T}}$ become intractable for ${\rm F{\small REE-}F{\small LOOD-}I{\small T}}$. We also show that some tractable cases for ${\rm F{\small IXED-}F{\small LOOD-}I{\small T}}$ are still tractable for ${\rm F{\small REE-}F{\small LOOD-}I{\small T}}$ but need considerably more involved arguments. We finally present some combinatorial properties connecting or separating the two problems. In particular, we show that the length of an optimal solution for ${\rm F{\small IXED-}F{\small LOOD-}I{\small T}}$ is always at most twice that of ${\rm F{\small REE-}F{\small LOOD-}I{\small T}}$, and this is tight.
DOI : 10.7155/jgaa.00486
Keywords: flood-filling game, parameterized complexity 
@article{JGAA_2019_23_2_a0,
     author = {R\'emy Belmonte and Mehdi Khosravian Ghadikolaei and Masashi Kiyomi and Michael Lampis and Yota Otachi},
     title = {How {Bad} is the {Freedom} to {Flood-It?}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {111--134},
     publisher = {mathdoc},
     volume = {23},
     number = {2},
     year = {2019},
     doi = {10.7155/jgaa.00486},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00486/}
}
TY  - JOUR
AU  - Rémy Belmonte
AU  - Mehdi Khosravian Ghadikolaei
AU  - Masashi Kiyomi
AU  - Michael Lampis
AU  - Yota Otachi
TI  - How Bad is the Freedom to Flood-It?
JO  - Journal of Graph Algorithms and Applications
PY  - 2019
SP  - 111
EP  - 134
VL  - 23
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00486/
DO  - 10.7155/jgaa.00486
LA  - en
ID  - JGAA_2019_23_2_a0
ER  - 
%0 Journal Article
%A Rémy Belmonte
%A Mehdi Khosravian Ghadikolaei
%A Masashi Kiyomi
%A Michael Lampis
%A Yota Otachi
%T How Bad is the Freedom to Flood-It?
%J Journal of Graph Algorithms and Applications
%D 2019
%P 111-134
%V 23
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00486/
%R 10.7155/jgaa.00486
%G en
%F JGAA_2019_23_2_a0
Rémy Belmonte; Mehdi Khosravian Ghadikolaei; Masashi Kiyomi; Michael Lampis; Yota Otachi. How Bad is the Freedom to Flood-It?. Journal of Graph Algorithms and Applications, Tome 23 (2019) no. 2, pp. 111-134. doi : 10.7155/jgaa.00486. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00486/

Cité par Sources :