# Winner Determination Algorithms for Graph Games with Matching Structures

Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

## Abstract

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(2n) 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(2n2) (= O(1. 4143n) ) time, which improves O(3n3) (= O(1. 4423n) ) by a direct adjustment of the analysis of Bodlaender et al.’s O(3n3) -time algorithm for Node Kayles.

Original language English Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Proceedings Cristina Bazgan, Henning Fernau Springer Science and Business Media Deutschland GmbH 509-522 14 9783031066771 https://doi.org/10.1007/978-3-031-06678-8_37 Published - 2022 33rd International Workshop on Combinatorial Algorithms, IWOCA 2022 - Trier, GermanyDuration: Jun 7 2022 → Jun 9 2022

### Publication series

Name Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 13270 LNCS 0302-9743 1611-3349

### Conference

Conference 33rd International Workshop on Combinatorial Algorithms, IWOCA 2022 Germany Trier 6/7/22 → 6/9/22

## All Science Journal Classification (ASJC) codes

• Theoretical Computer Science
• General Computer Science

## Fingerprint

Dive into the research topics of 'Winner Determination Algorithms for Graph Games with Matching Structures'. Together they form a unique fingerprint.