Author:
Gent Ian P.,MacIntyre Ewan,Presser Patrick,Smith Barbara M.,Walsh Toby
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. D. Brelaz. New methods to color the vertices of a graph. JACM, 22(4):251–256, 1979.
2. P. Cheeseman, B. Kanefsky, and W.M. Taylor. Where the really hard problems are. In Proc. IJCAI-91, pages 331–337, 1991.
3. R. Dechter and I. Meiri. Experimental evaluation of preprocessing algorithms for constraint satisfaction problems. Artificial Intelligence, 68:211–241, 1994.
4. R. Feldman and M.C. Golumbic. Interactive scheduling as a constraint satisfaction problem. Annals of Mathematics and Artificial Intelligence, 1:49–73, 1990.
5. J. Gaschnig. A general backtracking algorithm that eliminates most redundant tests. In Proc. IJCAI-77, page 457, 1977.
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献