RT - Journal Article
T1 - On the Computational Complexity of the Domination Game
JF - IJMSI
YR - 2015
JO - IJMSI
VO - 10
IS - 2
UR - http://ijmsi.ir/article-1-794-en.html
SP - 115
EP - 122
K1 - Domination game
K1 - Game domination number
K1 - Complexity of algorithms.
AB - The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the graph $G$ considered has maximum diameter, the complexity is improved to $mathcal O (|V(G)|cdot |E(G)|+Delta(G)^3)$.
LA eng
UL http://ijmsi.ir/article-1-794-en.html
M3 10.7508/ijmsi.2015.02.011
ER -