An Empirical Comparison of Backtracking Algorithms
暂无分享,去创建一个
[1] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[2] Edward M. Reingold,et al. Backtrack programming techniques , 1975, CACM.
[3] Paul Walton Purdom,et al. An Analysis of Backtracking with Search Rearrangement , 1983, SIAM J. Comput..
[4] Robert M. Haralick,et al. The Consistent Labeling Problem: Part I , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[5] Paul Walton Purdom,et al. An Average Time Analysis of Backtracking , 1981, SIAM J. Comput..
[6] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[7] J. Gaschnig. Performance measurement and analysis of certain search algorithms. , 1979 .
[8] Azriel Rosenfeld,et al. Reduction operations for constraint satisfaction , 1978, Inf. Sci..
[9] Paul Walton Purdom,et al. Average Time Analyses of Simplified Davis-Putnam Procedures , 1982, Inf. Process. Lett..
[10] Paul Walton Purdom. Tree Size by Partial Backtracking , 1978, SIAM J. Comput..
[11] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[12] R M Haralick,et al. The consistent labeling problem: part I. , 1979, IEEE transactions on pattern analysis and machine intelligence.
[13] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[14] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[15] Robert M. Haralick,et al. Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..