On structural parameterizations of Node Kayles

DOI10.1007/978-3-030-90048-9_8OpenAlexW2947640210MaRDI QIDQ2695476

Yasuaki Kobayashi

Publication date: 31 March 2023

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

zbMATH Keywords

fixed-parameter tractabilitystructural parameterizationNode Kayles

Mathematics Subject Classification ID

Applications of game theory (91A80) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Winner determination algorithms for graph games with matching structures ⋮ Winner determination algorithms for graph games with matching structures

Cites Work

• Exact algorithms for Kayles
• On the complexity of some two-person perfect-information games
• Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
• Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(\) and PSPACE analogues]
• Kayles and Nimbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On structural parameterizations of Node Kayles