1 paper
Attila Hideg, Tamas Lukovszki
We consider the problem of filling an unknown area represented by an arbitrary connected graph of n vertices by mobile luminous robots. In this problem, the robots enter the grap…