Winner Determination Algorithms for Graph Games with Matching Structures

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...

Full description

Saved in:
Bibliographic Details
Published in:Algorithmica Vol. 86; no. 3; pp. 808 - 824
Main Authors: Hanaka, Tesshu, Kiya, Hironori, Ono, Hirotaka, Yoshiwatari, Kanae
Format: Journal Article
Language:English
Published: New York Springer US 01.03.2024
Springer Nature B.V
Subjects:
Algorithm Analysis and Problem Complexity
Algorithms
Combinatorial analysis
Computer Science
Computer Systems Organization and Communication Networks
Data Structures and Information Theory
Games
Graph theory
Matching
Mathematics of Computing
Theory of Computation
Trees (mathematics)
Vertex cover
Neighborhood diversity
Combinatorial game theory
Exact exponential-time algorithm
ISSN:0178-4617, 1432-0541
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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, while 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 the input 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 .
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-023-01136-w