On structural parameterizations of Node Kayles
From MaRDI portal
Publication:2695476
DOI10.1007/978-3-030-90048-9_8MaRDI QIDQ2695476
Publication date: 31 March 2023
Full work available at URL: https://arxiv.org/abs/2003.11775
91A80: Applications of game theory
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
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