Winner determination algorithms for graph games with matching structures

DOI10.1007/s00453-023-01136-warXiv2211.05307MaRDI QIDQ6119832

Tesshu Hanaka, Hirotaka Ono, Kanae Yoshiwatari, Hironori Kiya

Publication date: 25 March 2024

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.05307

zbMATH Keywords

vertex covercombinatorial game theoryneighborhood diversityexact exponential-time algorithm\textsc{Arc Kayles}

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Exact algorithms for Kayles
• New results for Domineering from combinatorial game theory endgame databases
• Improved upper bounds for vertex cover
• On the complexity of some two-person perfect-information games
• Algorithmic meta-theorems for restrictions of treewidth
• Solving \(8\times 8\) Domineering
• \(11\times 11\) Domineering is solved: the first player wins
• Winner determination algorithms for graph games with matching structures
• On structural parameterizations of Node Kayles
• Kayles and Nimbers
• The Computational Complexity of the Game of Set and Its Theoretical Applications
• Unnamed Item

This page was built for publication: Winner determination algorithms for graph games with matching structures