{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T21:13:35Z","timestamp":1784236415032,"version":"3.55.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1995,2,1]],"date-time":"1995-02-01T00:00:00Z","timestamp":791596800000},"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":6741,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1995,2]]},"DOI":"10.1016\/0166-218x(94)00103-k","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:02:29Z","timestamp":1027634549000},"page":"193-212","source":"Crossref","is-referenced-by-count":97,"title":["Expected complexity of graph partitioning problems"],"prefix":"10.1016","volume":"57","author":[{"given":"Lud\u011bk","family":"Ku\u010dera","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00103-K_BIB1","unstructured":"N. Alon and N. Kahale, A spectral technique for coloring random 3 colorable graphs (extended abstract), in: Annual ACM Symposium on Theory of Computing '94, to appear."},{"key":"10.1016\/0166-218X(94)00103-K_BIB2","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s, The chromatic number of random graphs, Combinatorica 8, 49\u201356.","DOI":"10.1007\/BF02122551"},{"key":"10.1016\/0166-218X(94)00103-K_BIB3","series-title":"Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science","first-page":"280","article-title":"Eigenvalues and graph bisection: An average case analysis","author":"Boppana","year":"1987"},{"key":"10.1016\/0166-218X(94)00103-K_BIB4","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0166-218X(94)00103-K_BIB5","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0196-6774(89)90001-1","article-title":"The solution of some random NP-hard problems in polynomial expected time","volume":"10","author":"Dyer","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(94)00103-K_BIB6","first-page":"313","article-title":"On colouring random graphs","volume":"77","author":"Grimmett","year":"1975"},{"key":"10.1016\/0166-218X(94)00103-K_BIB7","series-title":"Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science","first-page":"94","article-title":"Simulated annealing for graph bisection","author":"Jerrum","year":"1993"},{"key":"10.1016\/0166-218X(94)00103-K_BIB8","series-title":"Foundations of Computation Theory 77","first-page":"447","article-title":"Expected behavior of graph coloring algorithms","volume":"56","author":"Ku\u010dera","year":"1977"},{"key":"10.1016\/0166-218X(94)00103-K_BIB9","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/0196-6774(91)90040-6","article-title":"The greedy coloring is a bad probabilistic algorithm","volume":"12","author":"Ku\u010dera","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(94)00103-K_BIB10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0020-0190(89)90200-7","article-title":"Graphs with small chromatic numbers are easy to color","volume":"30","author":"Ku\u010dera","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(94)00103-K_BIB11","series-title":"Random Graphs '87","first-page":"175","article-title":"An expose-and-merge algorithm and the chromatic number of a random graph","author":"Matula","year":"1990"},{"key":"10.1016\/0166-218X(94)00103-K_BIB12","unstructured":"H.J. Pr\u00f6mel and A. Steger, Random l-colorable graphs, Random Structures Algorithms, submitted."},{"key":"10.1016\/0166-218X(94)00103-K_BIB13","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":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400103K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400103K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T23:54:47Z","timestamp":1555286087000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9400103K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,2]]},"references-count":13,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1995,2]]}},"alternative-id":["0166218X9400103K"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00103-k","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,2]]}}}