Flooding games on graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Applied Mathematics Year : 2014

Flooding games on graphs


We study a discrete di usion process introduced in some combinatorial puzzles called Flood-It, Mad Virus or HoneyBee that can be played online and whose computational complexities have recently been studied. Originally defi ned 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 (ENGLISH VERSION of [11])
Fichier principal
Vignette du fichier
FLOODS-DAM.pdf (290.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00653714 , version 1 (20-12-2011)





Aurélie Lagoutte, Mathilde Noual, Eric Thierry. Flooding games on graphs. Discrete Applied Mathematics, 2014, LAGOS’11, Part 2, 164, pp.532-538. ⟨10.1016/j.dam.2013.09.024⟩. ⟨hal-00653714⟩
365 View
239 Download



Gmail Facebook X LinkedIn More