{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T03:48:55Z","timestamp":1774583335052,"version":"3.50.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4368,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s0304-3975(01)00164-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:15:02Z","timestamp":1027617302000},"page":"227-264","source":"Crossref","is-referenced-by-count":75,"title":["Frozen development in graph coloring"],"prefix":"10.1016","volume":"265","author":[{"given":"Joseph","family":"Culberson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Gent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00164-5_BIB1","doi-asserted-by":"crossref","unstructured":"R.J. Bayardo Jr., R.C. Schrag, Using CSP look-back techniques to solve exceptionally hard SAT instances, Principles and Practice of Constraint Programming \u2014 CP96, Springer, 1996, pp. 46\u201360.","DOI":"10.1007\/3-540-61551-2_65"},{"key":"10.1016\/S0304-3975(01)00164-5_BIB2","unstructured":"R. Beigel, D. Eppstein, 3-coloring in time O(1.3446n): a no-MIS algorithm, 36th IEEE Symp. on Foundations of Computer Science, 1995, pp. 444\u2013452."},{"key":"10.1016\/S0304-3975(01)00164-5_BIB3","series-title":"Modern Graph Theory","volume":"vol. 184","author":"Bollob\u00e1s","year":"1998"},{"key":"10.1016\/S0304-3975(01)00164-5_BIB4","unstructured":"B. Bollob\u00e1s, C. Borgs, J.T. Chayes, J.H. Kim, D.B. Wilson, The scaling window of the 2-SAT transition, 1999, Paper in the xxx.lanl.gov e-Print archive. Available from http:\/\/xxx.lanl.gov\/abs\/math.CO\/9909031."},{"key":"10.1016\/S0304-3975(01)00164-5_BIB5","unstructured":"P. Cheeseman, B. Kanefsky, W.M. Taylor, Where the really hard problems are, Proc. 12th IJCAI, 1991, pp. 331\u2013337."},{"issue":"4","key":"10.1016\/S0304-3975(01)00164-5_BIB6","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1145\/48014.48016","article-title":"Many hard examples for resolution","volume":"35","author":"Chvatal","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00164-5_BIB7","doi-asserted-by":"crossref","unstructured":"J.M. Crawford, L.D. Auton, Experimental results on the crossover point in random 3-SAT, Artificial Intelligence 81 (1996) 31\u201357. Code at www.cirl.uoregon.edu\/crawford.","DOI":"10.1016\/0004-3702(95)00046-1"},{"key":"10.1016\/S0304-3975(01)00164-5_BIB8","unstructured":"J. Culberson, I.P. Gent, Well out of reach: why hard problems are hard, Techn. Report APES-13-1999, APES Research Group, 1999. Available from http:\/\/apes.cs.strath.ac.uk\/apesreports.html."},{"key":"10.1016\/S0304-3975(01)00164-5_BIB9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0004-3702(95)00047-X","article-title":"The satisfiability constraint gap","volume":"81","author":"Gent","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(01)00164-5_BIB10","series-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1993","first-page":"285","article-title":"Coloring by TABU branch and bound","volume":"vol. 26","author":"Glover","year":"1996"},{"key":"10.1016\/S0304-3975(01)00164-5_BIB11","first-page":"69","article-title":"Remarks on the graph colour theorem of Haj\u00f3s","volume":"55","author":"Hanson","year":"1986","journal-title":"Congr. Numer."},{"key":"10.1016\/S0304-3975(01)00164-5_BIB12","unstructured":"B. Hayes, Can't get no satisfaction, Amer. Scientist 85 (1997) 108\u2013112. http:\/\/www.amsci.org\/amsci\/issues\/Comsci97\/compsci9703.html."},{"key":"10.1016\/S0304-3975(01)00164-5_BIB13","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0004-3702(94)90088-4","article-title":"The hardest constraint problems: a double phase transition","volume":"69","author":"Hogg","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(01)00164-5_BIB14","series-title":"Graph Coloring Problems","author":"Jensen","year":"1995"},{"key":"10.1016\/S0304-3975(01)00164-5_BIB15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1070\/RM1985v040n01ABEH003529","article-title":"The main properties of random graphs with a large number of vertices and edges","volume":"40","author":"Korshunov","year":"1985","journal-title":"Russian Math. Surveys"},{"key":"10.1016\/S0304-3975(01)00164-5_BIB16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1613\/jair.370","article-title":"A new look at the easy-hard-easy pattern of combinatorial search difficulty","volume":"7","author":"Mammen","year":"1997","journal-title":"J. Artificial Intelligence Res."},{"issue":"1","key":"10.1016\/S0304-3975(01)00164-5_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0208001","article-title":"Determining the chromatic number of a graph","volume":"8","author":"McDiarmid","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00164-5_BIB18","unstructured":"D. Mitchell, B. Selman, H. Levesque, Hard and easy distributions of SAT problems, Proc. AAAI-92, 1992, pp. 459\u2013465."},{"key":"10.1016\/S0304-3975(01)00164-5_BIB19","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1103\/PhysRevE.56.1357","article-title":"Statistical mechanics of the random k-sat model","volume":"56","author":"Monasson","year":"1997","journal-title":"Phys. Rev. E"},{"key":"10.1016\/S0304-3975(01)00164-5_BIB20","unstructured":"R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, L. Troyansky, Phase transition and search cost in the 2+p-sat problem, in: T. Toffoli, M. Biafore, J. Leao (Eds.), Proc. PhysComp 96, Boston, 1996. http:\/\/www.lpt.ens.fr\/ monasson\/http:\/\/www.ictp.trieste.it\/ zecchina."},{"key":"10.1016\/S0304-3975(01)00164-5_BIB21","doi-asserted-by":"crossref","unstructured":"R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, L Troyansky, Determining computational complexity from characteristic \u2018phase transitions\u2019, Nature 400 (1998) 133\u2013137. http:\/\/www.lpt.ens.fr\/ monasson\/ http:\/\/www.ictp.trieste.it\/ z ecchina.","DOI":"10.1038\/22055"},{"key":"10.1016\/S0304-3975(01)00164-5_BIB22","doi-asserted-by":"crossref","unstructured":"R. Monasson, R. Zecchina, B. Selman, L. Troyansky, 2+P-SAT: relation of typical-case complexity to the nature of the phase transition, 1999.","DOI":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<414::AID-RSA10>3.0.CO;2-G"},{"key":"10.1016\/S0304-3975(01)00164-5_BIB23","series-title":"Graphical Evolution: An introduction to the Theory of Random Graphs","author":"Palmer","year":"1985"},{"key":"10.1016\/S0304-3975(01)00164-5_BIB24","unstructured":"A. Parkes, Clustering at the phase transition, Proc. AAAI-97, 1997, pp. 340\u2013345."},{"key":"10.1016\/S0304-3975(01)00164-5_BIB25","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0004-3702(95)00048-8","article-title":"An empirical study of phase transitions in binary constraint satisfaction problems","volume":"81","author":"Prosser","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(01)00164-5_BIB26","unstructured":"I. Ross, Finding all muses, 1997. Personal communication, isla@cs.strath.ac.uk."},{"key":"10.1016\/S0304-3975(01)00164-5_BIB27","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0004-3702(95)00052-6","article-title":"Locating the phase transition in binary constraint satisfaction problems","volume":"81","author":"Smith","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(01)00164-5_BIB28","doi-asserted-by":"crossref","unstructured":"B. Vandegriend, J. Culberson, The Gnm phase transition is not hard for the Hamiltonian cycle problem, J. Artificial Intelligence Res. 9 (1998) 219\u2013245. www.jair.org\/contents\/v9.html.","DOI":"10.1613\/jair.512"},{"key":"10.1016\/S0304-3975(01)00164-5_BIB29","unstructured":"D.B. Wilson, personal communication, September 1999."},{"key":"10.1016\/S0304-3975(01)00164-5_BIB30","unstructured":"R. Zecchina, personal communication."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001645?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001645?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T11:05:20Z","timestamp":1580209520000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501001645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S0304397501001645"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00164-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}