Winner determination algorithms for graph games with matching structures

DOI10.1007/978-3-031-06678-8_37OpenAlexW4285191720MaRDI QIDQ2169988

Hironori Kiya, Hirotaka Ono, Tesshu Hanaka, Kanae Yoshiwatari

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-06678-8_37

zbMATH Keywords

vertex covercombinatorial game theoryneighborhood diversityArc Kaylesexact exponential-time algorithm

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Winner determination algorithms for graph games with matching structures

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• On structural parameterizations of Node Kayles
• Kayles and Nimbers
• The Computational Complexity of the Game of Set and Its Theoretical Applications

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