18 citations · 46 across the 3 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2012★ 11 cited
Spanning trees and the complexity of flood-filling games
Kitty Meeks, Alexander Scott
We consider 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 ope…
cs.DS2011★ 18 cited
The complexity of flood-filling games on graphs
Kitty Meeks, Alexander Scott
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…
cs.DS2011★ 17 cited
The complexity of Free-Flood-It on 2xn boards
Kitty Meeks, Alexander Scott
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…