The Flood-It game parameterized by the vertex cover number

DOI10.1016/j.endm.2015.07.007zbMath1347.05122OpenAlexW2197465644MaRDI QIDQ324714

Uéverton dos Santos Souza, Maise Dantas da Silva, Michael R. Fellows, Fábio Protti, Frances A. Rosamond

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.007

zbMATH Keywords

fixed-parameter tractabilityFlood-Itpolynomial kernelization

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

A Survey on the Complexity of Flood-Filling Games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of free-flood-it on \(2\times n\) boards
• The complexity of flood-filling games on graphs
• Spanning trees and the complexity of flood-filling games
• The complexity of flood filling games
• An algorithmic analysis of the Honey-Bee game
• Tractability and hardness of flood-filling games on trees
• Flooding games on graphs
• Parameterized Complexity of Flood-Filling Games on Trees

This page was built for publication: The Flood-It game parameterized by the vertex cover number