27 citations · 100 across the 27 of their papers we have counts for
Showing 2011 · cs.DSShow all
2 papers · 2 filters
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…