Author/Authors :
Klavzar، Sandi نويسنده aculty of Mathematics and Physics, University of Ljubljana, Slovenia. , , Kosmrlj، Gasper نويسنده Abelium, R&D d.o.o., Ljubljana, Slovenia. , , Schmidt، Simon نويسنده Institut Fourier, SFR Maths `a Modeler, Joseph Fourier’s University, Grenoble, France. ,
Abstract :
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 O(?(G) · |V (G)|k) time. In
the special case when k = 3 and the graph G considered has maximum
diameter, the complexity is improved to O(|V (G)| · |E(G)| + ?(G)3).
