A survey about Solitaire Clobber
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] SCIENCE NEWS. , 2022, Science.
[3] David Wolfe,et al. An introduction to clobber. , 2005 .
[4] Robert W. Irving. On Approximating the Minimum Independent Dominating Set , 1991, Inf. Process. Lett..
[5] W. Marsden. I and J , 2012 .
[6] Martin Farber,et al. Independent domination in chordal graphs , 1982, Oper. Res. Lett..
[7] David B. Shmoys,et al. A Best Possible Heuristic for the k-Center Problem , 1985, Math. Oper. Res..
[8] Sylvain Gravier,et al. New results about impartial solitaire clobber , 2009, RAIRO Oper. Res..
[9] J. P. Grossman. Appendix A: Report on the First International Clobber Tournament , 2004, Theor. Comput. Sci..
[10] Sylvain Gravier,et al. SOLITAIRE CLOBBER PLAYED ON HAMMING GRAPHS , 2008 .
[11] Erik D. Demaine,et al. Solitaire Clobber , 2004, Theor. Comput. Sci..
[12] S HochbaumDorit,et al. A Best Possible Heuristic for the k-Center Problem , 1985 .
[13] Béla Bollobás,et al. Random Graphs , 1985 .
[14] G. Nemhauser,et al. The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs , 1984 .
[15] Jayme Luiz Szwarcfiter,et al. Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..
[16] Solitaire Clobber as an optimization problem on words , 2008 .