On the complexity of loop fusion
Parallel Computing - Special issue on new trends on scheduling in parallel and distributed systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of flood filling games
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
The Complexity of Flood Filling Games
Theory of Computing Systems - Special Issue: Fun with Algorithms
The complexity of flood-filling games on graphs
Discrete Applied Mathematics
An algorithmic analysis of the Honey-Bee game
Theoretical Computer Science
Spanning trees and the complexity of flood-filling games
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
| Hi-index | 0.04 |
We study a discrete diffusion process introduced in some combinatorial puzzles called Flood-It, Mad Virus, or Honey-Bee, that can be played online and whose computational complexities have recently been studied. Originally defined on regular boards, we show that studying their dynamics directly on general graphs is valuable: we synthesize and extend previous results, we show how to solve Flood-It on cycles by computing a poset height and how to solve the 2-Free-Flood-It variant by computing a graph radius.