Exact algorithms for Kayles
DOI10.1016/J.TCS.2014.09.042zbMATH Open1305.05143OpenAlexW1970560697WikidataQ59567437 ScholiaQ59567437MaRDI QIDQ476858FDOQ476858
Authors: Hans L. Bodlaender, Dieter Kratsch, Sjoerd T. Timmer 
Publication date: 2 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.09.042
Recommendations
analysis of algorithmsexact algorithmsgraph algorithmscombinatorial gamesindependent setsmoderately exponential time algorithms
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) 2-person games (91A05) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Combinatorial games (91A46)
Cites Work
- A measure \& conquer approach for the analysis of exact algorithms
- Exact exponential algorithms.
- Title not available (Why is that?)
- The complexity of satisfiability problems
- Title not available (Why is that?)
- On the complexity of some two-person perfect-information games
- Compound Node-Kayles on paths
- A faster algorithm for dominating set analyzed by the potential method
- Exact algorithms for Kayles
- Kayles and Nimbers
Cited In (7)
- Winner determination algorithms for graph games with matching structures
- Winner determination algorithms for graph games with matching structures
- On a class of strongly asymmetric PKA algorithms
- Games on interval and permutation graph representations
- Kayles and Nimbers
- On structural parameterizations of Node Kayles
- Exact algorithms for Kayles
This page was built for publication: Exact algorithms for Kayles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476858)
