The eternal dominating set problem for interval graphs
classification
💻 cs.DM
math.CO
keywords
eternaldominatinggraphsintervalproblemalgorithmby-productclique-connected
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.