Exact Algorithms for Kayles

DOI10.1007/978-3-642-25870-1_7zbMath1339.05251DBLPconf/wg/BodlaenderK11OpenAlexW1760031592WikidataQ59567579 ScholiaQ59567579MaRDI QIDQ3104765

Dieter Kratsch, Hans L. Bodlaender

Publication date: 16 December 2011

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25870-1_7

zbMATH Keywords

game of Kaylesrunning time of an algorithm

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

Impartial coloring games ⋮ Exact algorithms for Kayles

Cites Work

• Exact exponential algorithms.
• Compound Node-Kayles on paths
• On the complexity of some two-person perfect-information games
• Kayles and Nimbers
• The complexity of satisfiability problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Exact Algorithms for Kayles