The complexity of flood-filling games on graphs release_ne3gzfxzrnhqhpcpgph5r2qy2y

by Kitty Meeks, Alexander Scott

Released as a article .

2011  

Abstract

We consider the complexity of problems related to the combinatorial game Free-Flood-It, in which players aim to make a coloured graph monochromatic with the minimum possible number of flooding operations. Although computing the minimum number of moves required to flood an arbitrary graph is known to be NP-hard, we demonstrate a polynomial time algorithm to compute the minimum number of moves required to link each pair of vertices. We apply this result to compute in polynomial time the minimum number of moves required to flood a path, and an additive approximation to this quantity for an arbitrary k x n board, coloured with a bounded number of colours, for any fixed k. On the other hand, we show that, for k>=3, determining the minimum number of moves required to flood a k x n board coloured with at least four colours remains NP-hard.
In text/plain format

Archived Files and Locations

application/pdf  347.5 kB
file_slpckoyubngjbdeu7svakau3qm
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2011-01-31
Version   v1
Language   en ?
arXiv  1101.5876v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: aab23b9f-b6d8-4261-bb70-45ccf56a1619
API URL: JSON