Faster winner determination algorithms for (Colored) Arc Kayles

Abstract

Arc Kayles and Colored Arc Kayles are generalized versions of well-studied combinatorial games Cram and Domineering, respectively. In Arc Kayles, two players alternately choose an edge to remove with its adjacent edges, and the player who cannot move is the loser. Colored Arc Kayles is similarly played on a graph with edges colored in black, white, or gray, in which the black (resp., white) player can choose only a gray or black (resp., white) edge. For Arc Kayles, the vertex cover number τ (i.e., the minimum size of a vertex cover) is an essential invariant because it is known that twice the vertex cover number upper bounds the number of turns of Arc Kayles, and for the winner determination of (Colored) Arc Kayles, $2^{O\left({\tau }^2\right)}{n}^{O\left(1\right)}$-time algorithms are known, where n is the number of vertices. In this paper, we first give a polynomial kernel for Colored Arc Kayles parameterized by τ, which leads to a faster $2^{O(\tau \log \tau )}{n}^{O\left(1\right)}$-time algorithm for Colored Arc Kayles. We then focus on Arc Kayles on trees, and propose a ${2.2361}^{\tau }{n}^{O\left(1\right)}$-time algorithm. Furthermore, we show that determining the winner of Arc Kayles on a tree can be done in $O\left({1.3831}^n\right)$ time, which improves the best-known running time of $O\left({1.4143}^n\right)$. Finally, we show that Colored Arc Kayles is NP-hard, the first hardness result in the family of the above games.