Undirected Vertex Geography (UVG) is an impartial two-person game played on a (undirected) graph G with a specified vertex u. Players, Alice and Bob, alternately choose a vertex that has not been chosen before and that is adjacent to the last chosen vertex. Alice plays first, choosing an adjacent vertex of u. The first player who is unable to choose a vertex loses. Determining whether Alice has a winning strategy in this game (the UVG problem) is known to be solvable in polynomial time. In this paper we study the complexity of the short version of this game (the short-UVG problem) in which it is asked whether Alice has a winning strategy that requires at most k moves, with k part of the input. We show that the short-UVG problem is PSPACE-complete even for bipartite graphs whereas a polynomial algorithm can be designed for trees. Finally, we introduce a partizan version of theUVG-game which we believe is of independent interest. We provide some preliminary results and conclude with many open problems.
|Titolo:||On variants of Vertex Geography on undirected graphs|
|Data di pubblicazione:||2018|
|Appare nelle tipologie:||01.1 - Articolo su rivista (Article)|