Leibniz International Proceedings in Informatics, LIPIcs 100 51-513 2018年6月 [査読有り]
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 possibl...