{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:27:49Z","timestamp":1751282869412},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_232","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:09:58Z","timestamp":1330261798000},"page":"31-37","source":"Crossref","is-referenced-by-count":6,"title":["Coloring random graphs in polynomial expected time"],"prefix":"10.1007","author":[{"given":"Martin","family":"Furer","sequence":"first","affiliation":[]},{"given":"C. R.","family":"Subramanian","sequence":"additional","affiliation":[]},{"given":"C. E.","family":"Veni Madhavan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"A. Blum, Some Tools for Approximate 3-Coloring, FOCS, 1990, 554\u2013562.","DOI":"10.1109\/FSCS.1990.89576"},{"key":"4_CR2","unstructured":"A. Blum and J. Spencer, Coloring Random and Semi-Random k-Colorable Graphs, Submitted to Journal of Algorithms."},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0196-6774(89)90001-1","volume":"10","author":"M.E. Dyer","year":"1989","unstructured":"M.E. Dyer and A.M. Frieze, The solution of Some Random NP-Hard Problems in Polynomial Expected Time, J. Alg., 10, 1989, 451\u2013489.","journal-title":"J. Alg."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"M.Furer and C.R. Subramanian, Coloring Random Graphs, SWAT,1992.","DOI":"10.1007\/3-540-55706-7_24"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"C. Lund and M. Yannakakis, On the Hardness of Approximating Minimization Problems, Proc. of Worshop on Approx. Algos. New Delhi, Dec 1992.","DOI":"10.1145\/167088.167172"},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0196-6774(88)90005-3","volume":"9","author":"J.S. Turner","year":"1988","unstructured":"J.S. Turner, Almost All k-colorable Graphs are Easy to Color, J. Alg., 9, 1988, 63\u201382.","journal-title":"J. Alg."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_232.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:06:15Z","timestamp":1619571975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_232","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}