• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

How Bad is the Freedom to Flood-It?

Belmonte, Rémy; Khosravian Ghadikolaei, Mehdi; Kiyomi, Masashi; Lampis, Michael; Otachi, Yota (2019), How Bad is the Freedom to Flood-It?, Journal of Graph Algorithms and Applications, 23, 2, p. 111-134. 10.7155/jgaa.00486

View/Open
how_bad.pdf (662.9Kb)
Type
Article accepté pour publication ou publié
Date
2019
Journal name
Journal of Graph Algorithms and Applications
Volume
23
Number
2
Publisher
Brown University
Pages
111-134
Publication identifier
10.7155/jgaa.00486
Metadata
Show full item record
Author(s)
Belmonte, Rémy

Khosravian Ghadikolaei, Mehdi

Kiyomi, Masashi

Lampis, Michael cc

Otachi, Yota
Abstract (EN)
Fixed-Flood-It and Free-Flood-It are combinatorial problems on graphs that generalize a very popular puzzle called Flood-It. Both problems consist of recoloring moves whose goal is to produce a monochromatic ("flooded") graph as quickly as possible. Their difference is that in Free-Flood-It the player has the additional freedom of choosing the vertex to play in each move. In this paper, we investigate how this freedom affects the complexity of the problem. It turns out that the freedom is bad in some sense. We show that some cases trivially solvable for Fixed-Flood-It become intractable for Free-Flood-It. We also show that some tractable cases for Fixed-Flood-It are still tractable for Free-Flood-It but need considerably more involved arguments. We finally present some combinatorial properties connecting or separating the two problems. In particular, we show that the length of an optimal solution for Fixed-Flood-It is always at most twice that of Free-Flood-It, and this is tight.
Subjects / Keywords
flood-filling game; parameterized complexity

Related items

Showing items related by title and author.

  • Thumbnail
    Parameterized Complexity of (A,ℓ)-Path Packing 
    Belmonte, Rémy; Hanaka, Tesshu; Kanzaki, Masaaki; Kiyomi, Masashi; Kobayashi, Yasuaki; Kobayashi, Yusuke; Lampis, Michael; Ono, Hirotaka; Otachi, Yota (2022) Article accepté pour publication ou publié
  • Thumbnail
    Independent Set Reconfiguration Parameterized by Modular-Width 
    Belmonte, Rémy; Hanaka, Tesshu; Lampis, Michael; Ono, Hirotaka; Otachi, Yota (2019) Communication / Conférence
  • Thumbnail
    Token Sliding on Split Graphs 
    Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota; Sikora, Florian (2019) Communication / Conférence
  • Thumbnail
    Parameterized Complexity of Safe Set 
    Belmonte, Rémy; Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Ono, Hirotaka; Otachi, Yota (2019) Communication / Conférence
  • Thumbnail
    Token Sliding on Split Graphs 
    Sikora, Florian; Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota (2020) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo