{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T06:06:27Z","timestamp":1648620387821},"reference-count":16,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0020-0190(97)00222-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"241-245","source":"Crossref","is-referenced-by-count":4,"title":["Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study"],"prefix":"10.1016","volume":"65","author":[{"given":"Jeremy","family":"Frank","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian P.","family":"Gent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0020-0190(97)00222-6_BIB1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","article-title":"Fast probabilistic algorithms for Hamiltonian circuits and matchings","volume":"18","author":"Angluin","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(97)00222-6_BIB2","first-page":"299","article-title":"The shortest path through many points","volume":"55","author":"Beardwood","year":"1959"},{"key":"10.1016\/S0020-0190(97)00222-6_BIB3","series-title":"Proc. 12th IJCAI","first-page":"331","article-title":"Where the really hard problems are","author":"Cheeseman","year":"1991"},{"key":"10.1016\/S0020-0190(97)00222-6_BIB4","series-title":"Proc. Workshop on Studying and Solving Really Hard Problems","article-title":"Phase transitions in random graphs","author":"Frank","year":"1995"},{"key":"10.1016\/S0020-0190(97)00222-6_BIB5","series-title":"Principles and Practice of Constraint Programming\u2014CP95","first-page":"70","article-title":"Scaling effects in the CSP phase transition","author":"Gent","year":"1995"},{"key":"10.1016\/S0020-0190(97)00222-6_BIB6","series-title":"Proc. AAAI-96","first-page":"246","article-title":"The constrainedness of search","author":"Gent","year":"1996"},{"key":"10.1016\/S0020-0190(97)00222-6_BIB7","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0004-3702(94)90109-0","article-title":"Easy problems are sometimes hard","volume":"70","author":"Gent","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0020-0190(97)00222-6_BIB8","series-title":"Proc. ECAI-96","first-page":"170","article-title":"Phase transitions and annealed theories: Number partitioning as a case study","author":"Gent","year":"1996"},{"key":"10.1016\/S0020-0190(97)00222-6_BIB9","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0004-3702(96)00030-6","article-title":"The TSP phase transition","volume":"88","author":"Gent","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0020-0190(97)00222-6_BIB10","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\/S0020-0190(97)00222-6_BIB11","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1126\/science.264.5163.1297","article-title":"Critical behavior in the satisfiability of random boolean expressions","volume":"264","author":"Kirkpatrick","year":"1994","journal-title":"Science"},{"key":"10.1016\/S0020-0190(97)00222-6_BIB12","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","author":"Korshunov","year":"1985","journal-title":"Russian Math. Surveys"},{"issue":"3","key":"10.1016\/S0020-0190(97)00222-6_BIB13","first-page":"760","article-title":"Solution of a problem of Erd\u00f6s and R\u00e9nyi on Hamiltonian cycles in nonoriented graphs","volume":"17","author":"Kor\u0161unov","year":"1976","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0020-0190(97)00222-6_BIB14","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1145\/356022.356030","article-title":"An enumerative algorithm for finding Hamiltonian circuits in a directed graph","volume":"9","author":"Martello","year":"1983","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0020-0190(97)00222-6_BIB15","series-title":"Proc. 12th AAAI-94","first-page":"337","article-title":"Noise strategies for improving local search","author":"Selman","year":"1994"},{"key":"10.1016\/S0020-0190(97)00222-6_BIB16","series-title":"Proc. IJCAI-95","first-page":"646","article-title":"Sparse constraint graphs and exceptionally hard problems","author":"Smith","year":"1995"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002226?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002226?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T12:54:37Z","timestamp":1556628877000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097002226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0020019097002226"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00222-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}