{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T03:11:22Z","timestamp":1772507482249,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1989,12]]},"DOI":"10.1016\/0196-6774(89)90001-1","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"451-489","source":"Crossref","is-referenced-by-count":111,"title":["The solution of some random NP-hard problems in polynomial expected time"],"prefix":"10.1016","volume":"10","author":[{"given":"M.E","family":"Dyer","sequence":"first","affiliation":[]},{"given":"A.M","family":"Frieze","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(89)90001-1_BIB1","series-title":"Proceedings, 25th IEEE Symposium on the Foundations of Computer Science","first-page":"181","article-title":"Graph bisection algorithms with good average case behaviour","author":"Bui","year":"1984"},{"key":"10.1016\/0196-6774(89)90001-1_BIB2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0166-218X(85)90008-3","article-title":"On the complexity of graph partitioning problems","volume":"10","author":"Dyer","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0196-6774(89)90001-1_BIB3","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0196-6774(89)90001-1_BIB4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.2307\/2282952","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/0196-6774(89)90001-1_BIB5","series-title":"Fundamentals of Computation Theory, 1977","first-page":"447","article-title":"Expected behaviour of graph colouring algorithms","volume":"Vol. 56","author":"Kucera","year":"1977"},{"key":"10.1016\/0196-6774(89)90001-1_BIB6","doi-asserted-by":"crossref","unstructured":"A. Thomason, Pseudo-random graphs, Ann. of Discrete Math., in press.","DOI":"10.1016\/S0304-0208(08)73063-9"},{"key":"10.1016\/0196-6774(89)90001-1_BIB7","unstructured":"A. Thomason, Dense expanders, to appear."},{"key":"10.1016\/0196-6774(89)90001-1_BIB8","unstructured":"J. S. Turner, On the probable performance of graph colouring algorithms, in \u201cProceedings, 1984 Allerton Conference on Communications, Control and Computing, pp. 281\u2013290."},{"key":"10.1016\/0196-6774(89)90001-1_BIB9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0196-6774(88)90005-3","article-title":"Almost all k-colorable graphs are easy to color","volume":"9","author":"Turner","year":"1988","journal-title":"J. Algorithms"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677489900011?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677489900011?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:54:28Z","timestamp":1548744868000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677489900011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["0196677489900011"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(89)90001-1","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}