The Flood-It game parameterized by the vertex cover number

Flood-It is a combinatorial problem on a colored graph whose aim is to make the graph monochromatic using the minimum number of flooding moves, relatively to a pivot vertex p. A flooding move consists of changing the color of the monochromatic component (maximal monochromatic connected subgraph) containing p. This problem generalizes a combinatorial game named alike which is played on m×n grids. It is known that Flood-It remains NP-hard even for 3×n grids and for instances with bounded number of colors, diameter, or treewidth. In contrast, in this work we show that Flood-It is fixed-parameter tractable when parameterized by the vertex cover number, and admits a polynomial kernelization when, besides the vertex cover number, the number of colors is an additional parameter.

[1]  Raphaël Clifford,et al.  The Complexity of Flood Filling Games , 2011, Theory of Computing Systems.

[2]  Kitty Meeks,et al.  Spanning Trees and the Complexity of Flood-Filling Games , 2012, Theory of Computing Systems.

[3]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[4]  Eric Thierry,et al.  Flooding games on graphs , 2014, Discret. Appl. Math..

[5]  Fábio Protti,et al.  An algorithmic analysis of Flood-it and Free-Flood-it on graph powers , 2014, Discret. Math. Theor. Comput. Sci..

[6]  Kitty Meeks,et al.  The complexity of flood-filling games on graphs , 2011, Discret. Appl. Math..

[7]  Kitty Meeks,et al.  The complexity of Free-Flood-It on 2×n boards , 2011, Theor. Comput. Sci..

[8]  Stefan Kratsch,et al.  Cross-Composition: A New Technique for Kernelization Lower Bounds , 2011, STACS.

[9]  Gerhard J. Woeginger,et al.  An algorithmic analysis of the Honey-Bee game , 2012, Theor. Comput. Sci..

[10]  Fábio Protti,et al.  Parameterized Complexity of Flood-Filling Games on Trees , 2013, COCOON.

[11]  Michael R. Fellows,et al.  Tractability and hardness of flood-filling games on trees , 2015, Theor. Comput. Sci..