{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:00:42Z","timestamp":1761487242780},"reference-count":9,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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":[[1991,12]]},"DOI":"10.1016\/0196-6774(91)90040-6","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T18:03:10Z","timestamp":1099764190000},"page":"674-684","source":"Crossref","is-referenced-by-count":33,"title":["The greedy coloring is a bad probabilistic algorithm"],"prefix":"10.1016","volume":"12","author":[{"given":"Lud\u011bk","family":"Ku\u010dera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(91)90040-6_BIB1","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","article-title":"Universal classes of hash functions","volume":"18","author":"Carter","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(91)90040-6_BIB2","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0196-6774(91)90040-6_BIB3","first-page":"313","article-title":"On coloring random graphs","volume":"77","author":"Grimmett","year":"1975"},{"key":"10.1016\/0196-6774(91)90040-6_BIB4","series-title":"Proceedings, of the 5th South-Eastern Conf. on Combinatorics, Graph Theory and Computation","first-page":"513","article-title":"Worst case behavior of graph coloring algorithms","author":"Johnson","year":"1974"},{"key":"10.1016\/0196-6774(91)90040-6_BIB5","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0196-6774(91)90040-6_BIB6","series-title":"Foundations of Computation Theory","first-page":"418","article-title":"Expected behavior of graph coloring algorithms","volume":"Vol. 118","author":"Ku\u010dera","year":"1977"},{"key":"10.1016\/0196-6774(91)90040-6_BIB7","series-title":"Algorithms and Complexity: New Directions and Recent Results","first-page":"21","article-title":"Probabilistic algorithms","author":"Rabin","year":"1976"},{"key":"10.1016\/0196-6774(91)90040-6_BIB8","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0206006","article-title":"A fast Monte-Carlo test for primality","volume":"6","author":"Solovay","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(91)90040-6_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:0196677491900406?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677491900406?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T08:57:19Z","timestamp":1549097839000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677491900406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["0196677491900406"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(91)90040-6","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}