Name
Abstract | ||
|---|---|---|
In the Eternal Domination game, a team of guard tokens initially occupies a dominating set on a graph G. A rioter then picks a node without a guard on it and attacks it. The guards defend against the attack: one of them has to move to the attacked node, while each remaining one can choose to move to one of his neighboring nodes. The new guards' placement must again be dominating. This attack-defend procedure continues perpetually. The guards win if they can eternally maintain a dominating set against any sequence of attacks, otherwise the rioter wins. We study rectangular grids and provide the first known general upper bound for these graphs. Our novel strategy implements a square rotation principle and eternally dominates mxn grids by using approximately mn/5 guards, which is asymptotically optimal even for ordinary domination. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-57586-5_33 | ALGORITHMS AND COMPLEXITY (CIAC 2017) |
Keywords | DocType | Volume |
Eternal domination,Combinatorial game,Two players,Graph protection,Grid | Conference | 10236 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| I. Lamprou | 1 | 0 | 1.01 |
| Russell Martin | 2 | 180 | 17.35 |
| Sven Schewe | 3 | 496 | 42.54 |