Eternally dominating large grids
- 1 November 2019
- journal article
- conference paper
- Published by Elsevier in Theoretical Computer Science
- Vol. 794, 27-46
Abstract
No abstract availableKeywords
Funding Information
- University of Liverpool
- Engineering and Physical Sciences Research Council (EP/P020909/1, EP/M027287/1)
This publication has 13 references indexed in Scilit:
- A note on the eternal dominating set problemInternational Journal of Game Theory, 2018
- Trees with large -eternal domination numberDiscrete Applied Mathematics, 2016
- Protecting a graph with mobile guardsApplicable Analysis and Discrete Mathematics, 2016
- Connected surveillance gameTheoretical Computer Science, 2015
- To satisfy impatient Web surfers is hardTheoretical Computer Science, 2014
- Graphs with equal eternal vertex cover and eternal domination numbersDiscrete Mathematics, 2011
- The Domination Number of GridsSIAM Journal on Discrete Mathematics, 2011
- Parameterized algorithm for eternal vertex coverInformation Processing Letters, 2010
- Tight bounds for eternal dominating sets in graphsDiscrete Mathematics, 2008
- Defending the Roman Empire—A new strategyDiscrete Mathematics, 2003