The complexity of free-flood-it on \(2\times n\) boards
From MaRDI portal
Publication:388453
DOI10.1016/j.tcs.2013.06.010zbMath1301.05227OpenAlexW1976510097MaRDI QIDQ388453
Kitty Meeks, Alexander D. Scott
Publication date: 19 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.06.010
Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (10)
Unnamed Item ⋮ The Flood-It game parameterized by the vertex cover number ⋮ Efficient approaches for the flooding problem on graphs ⋮ A Survey on the Complexity of Flood-Filling Games ⋮ The complexity of flood-filling games on graphs ⋮ How Bad is the Freedom to Flood-It? ⋮ Flooding games on graphs ⋮ Spanning trees and the complexity of flood-filling games ⋮ Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number ⋮ Tractability and hardness of flood-filling games on trees
Cites Work
This page was built for publication: The complexity of free-flood-it on \(2\times n\) boards
