Flooding games on graphs
DOI10.1016/J.DAM.2013.09.024zbMATH Open1288.05175OpenAlexW1981014315MaRDI QIDQ2448890FDOQ2448890
Mathilde Noual, Eric Thierry, A. Lagoutte
Publication date: 5 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00653714/file/FLOODS-DAM.pdf
Recommendations
- The complexity of flood-filling games on graphs
- On complexity of flooding games on graphs with interval representations
- The complexity of flood filling games
- Spanning trees and the complexity of flood-filling games
- Extremal properties of flood-filling games
- A Survey on the Complexity of Flood-Filling Games
- Games on graphs
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Combinatorial games (91A46)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of free-flood-it on \(2\times n\) boards
- The complexity of flood-filling games on graphs
- The complexity of flood filling games
- An algorithmic analysis of the Honey-Bee game
- On Complexity of Flooding Games on Graphs with Interval Representations
- On the complexity of loop fusion
Cited In (9)
- A Survey on the Complexity of Flood-Filling Games
- How Bad is the Freedom to Flood-It?
- Title not available (Why is that?)
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number
- The Flood-It game parameterized by the vertex cover number
- Spanning trees and the complexity of flood-filling games
- Title not available (Why is that?)
- Efficient approaches for the flooding problem on graphs
- Tractability and hardness of flood-filling games on trees
This page was built for publication: Flooding games on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448890)
