Parameterized Complexity of Flood-Filling Games on Trees

DOI10.1007/978-3-642-38768-5_47zbMath1382.68126OpenAlexW2252470939MaRDI QIDQ4925268

Uéverton dos Santos Souza, Maise Dantas da Silva, Fábio Protti

Publication date: 11 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38768-5_47

zbMATH Keywords

graph algorithmsNP-hardnesscombinatorial gamesfixed-parameter tractabilityW[1-hardness]

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial games (91A46)

Related Items (5)

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 ⋮ 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

This page was built for publication: Parameterized Complexity of Flood-Filling Games on Trees