2000 character limit reached
The eternal dominating set problem for interval graphs
Published 29 Aug 2018 in cs.DM and math.CO | (1808.09591v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.