Show simple item record

How Bad is the Freedom to Flood-It?

hal.structure.identifier
dc.contributor.authorBelmonte, Rémy*
hal.structure.identifier
dc.contributor.authorKhosravian Ghadikolaei, Mehdi*
hal.structure.identifier
dc.contributor.authorKiyomi, Masashi*
hal.structure.identifier
dc.contributor.authorLampis, Michael
HAL ID: 182546
ORCID: 0000-0002-5791-0887		*
hal.structure.identifier
dc.contributor.authorOtachi, Yota*
dc.date.accessioned2019-10-10T08:25:15Z
dc.date.available2019-10-10T08:25:15Z
dc.date.issued2019
dc.identifier.issn1526-1719
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/20061
dc.language.isoenen
dc.subjectflood-filling game
dc.subjectparameterized complexity
dc.subject.ddc005en
dc.titleHow Bad is the Freedom to Flood-It?
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenFixed-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.
dc.relation.isversionofjnlnameJournal of Graph Algorithms and Applications
dc.relation.isversionofjnlvol23
dc.relation.isversionofjnlissue2
dc.relation.isversionofjnldate2019
dc.relation.isversionofjnlpages111-134
dc.relation.isversionofdoi10.7155/jgaa.00486
dc.relation.isversionofjnlpublisherBrown University
dc.subject.ddclabelProgrammation, logiciels, organisation des donnéesen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
dc.description.ssrncandidatenon
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.relation.Isversionofjnlpeerreviewedoui
dc.date.updated2020-04-03T13:32:06Z
hal.identifierhal-02310396*
hal.version1*
hal.update.actionupdateFiles*
hal.update.actionupdateMetadata*
hal.author.functionaut
hal.author.functionaut
hal.author.functionaut
hal.author.functionaut
hal.author.functionaut


Files in this item

Thumbnail
Name:
how_bad.pdf
Size:
662.9Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record