Edge-matching Problems with Rotations
暂无分享,去创建一个
[1] Ivan Rapaport,et al. Complexity of Tile Rotation Problems , 1997, Theor. Comput. Sci..
[2] Erik D. Demaine,et al. Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity , 2007, Graphs Comb..
[3] Martin Ebbesen. Analysis of restricted edge-matching problems , 2011 .
[4] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[5] Ortrud R. Oellermann,et al. An Eulerian exposition , 1986, J. Graph Theory.
[6] Andrzej Lingas,et al. Approximability of Edge Matching Puzzles , 2009, SOFSEM.
[7] Peter C. Cheeseman,et al. Where the Really Hard Problems Are , 1991, IJCAI.
[8] P. Pevzner,et al. An Eulerian path approach to DNA fragment assembly , 2001, Proceedings of the National Academy of Sciences of the United States of America.
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .