Exact algorithms for Kayles
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3761989 (Why is no real title available?)
- scientific article; zbMATH DE number 3521877 (Why is no real title available?)
- A faster algorithm for dominating set analyzed by the potential method
- A measure \& conquer approach for the analysis of exact algorithms
- Compound Node-Kayles on paths
- Exact algorithms for Kayles
- Exact exponential algorithms.
- Kayles and Nimbers
- On the complexity of some two-person perfect-information games
- The complexity of satisfiability problems
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)