Winner Determination Algorithms for Graph Games with Matching Structures

11/10/2022
by   Tesshu Hanaka, et al.
0

Cram, Domineering, and Arc Kayles are well-studied combinatorial games. They are interpreted as edge-selecting-type games on graphs, and the selected edges during a game form a matching. In this paper, we define a generalized game called Colored Arc Kayles, which includes these games. Colored Arc Kayles is played on a graph whose edges are colored in black, white, or gray, and black (resp., white) edges can be selected only by the black (resp., white) player, although gray edges can be selected by both black and white players. We first observe that the winner determination for Colored Arc Kayles can be done in O^*(2^n) time by a simple algorithm, where n is the order of a graph. We then focus on the vertex cover number, which is linearly related to the number of turns, and show that Colored Arc Kayles, BW-Arc Kayles, and Arc Kayles are solved in time O^*(1.4143^τ^2+3.17τ), O^*(1.3161^τ^2+4τ), and O^*(1.1893^τ^2+6.34τ), respectively, where τ is the vertex cover number. Furthermore, we present an O^*((n/ν+1)^ν)-time algorithm for Arc Kayles, where ν is neighborhood diversity. We finally show that Arc Kayles on trees can be solved in O^* (2^n/2)(=O(1.4143^n)) time, which improves O^*(3^n/3)(=O(1.4423^n)) by a direct adjustment of the analysis of Bodlaender et al.'s O^*(3^n/3)-time algorithm for Node Kayles.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/20/2020

A Faster Parameterized Algorithm for Temporal Matching

A temporal graph is a sequence of graphs (called layers) over the same v...
research
05/26/2020

INFLUENCE: a partizan scoring game on graphs

We introduce the game INFLUENCE, a scoring combinatorial game, played on...
research
11/15/2021

Metric dimension on sparse graphs and its applications to zero forcing sets

The metric dimension dim(G) of a graph G is the minimum cardinality of a...
research
01/13/2023

Sublinear Algorithms for TSP via Path Covers

We study sublinear time algorithms for the traveling salesman problem (T...
research
11/11/2022

The Stackelberg Game: responses to regular strategies

Following the solution to the One-Round Voronoi Game in arXiv:2011.13275...
research
02/07/2020

Population Monotonic Allocation Schemes for Vertex Cover Games

For the class of vertex cover games (introduced by Deng et al., Math. Op...
research
07/20/2017

Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs

Pebble games are single-player games on DAGs involving placing and movin...

Please sign up or login with your details

Forgot password? Click here to reset