Name
Abstract | ||
|---|---|---|
In the m-Eternal Domination game, a team of guard tokens initially occupies a dominating set on a graph G. An attacker then picks a vertex without a guard on it and attacks it. The guards defend against the attack: one of them has to move to the attacked vertex, while each remaining one can choose to move to one of his neighboring vertices. The new guards' placement must again be dominating. This attack-defend procedure continues eternally. The guards win if they can eternally maintain a dominating set against any sequence of attacks, otherwise the attacker wins. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.tcs.2018.09.008 | Theoretical Computer Science |
Keywords | Field | DocType |
Eternal domination,Combinatorial game,Two players,Graph Protection,Grid | Discrete mathematics,Graph,Combinatorics,Dominating set,Vertex (geometry),Upper and lower bounds,Domination analysis,Guard (information security),Asymptotically optimal algorithm,Mathematics | Journal |
Volume | ISSN | Citations |
794 | 0304-3975 | 0 |
PageRank | References | Authors |
0.34 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| I. Lamprou | 1 | 0 | 1.01 |
| Russell Martin | 2 | 180 | 17.35 |
| Sven Schewe | 3 | 12 | 4.70 |