2000 character limit reached
The eternal dominating set problem for interval graphs (1808.09591v1)
Published 29 Aug 2018 in cs.DM and math.CO
Abstract: We prove that, in games in which all the guards move at the same turn, the eternal domination and the clique-connected cover numbers coincide for interval graphs. A linear algorithm for the eternal dominating set problem is obtained as a by-product.