{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:24Z","timestamp":1725662844871},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540084426"},{"type":"electronic","value":"9783540370840"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1977]]},"DOI":"10.1007\/3-540-08442-8_114","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:28:48Z","timestamp":1330169328000},"page":"447-451","source":"Crossref","is-referenced-by-count":19,"title":["Expected behavior of graph coloring algorithms"],"prefix":"10.1007","author":[{"given":"L.","family":"Ku\u010dera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"51_CR1","volume-title":"Probabilistic Method in Combinatorics","author":"P. Erd\u00f6s","year":"1974","unstructured":"P. Erd\u00f6s and J. Spencer, Probabilistic Method in Combinatorics, Academic Press, New York, 1974."},{"issue":"1","key":"51_CR2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/321921.321926","volume":"23","author":"M. R. Garey","year":"1976","unstructured":"M.R. Garey and D.S. Johnson, The complexity of near-optimal graph coloring, JACM 23, 1 (1976), 43\u201349.","journal-title":"JACM"},{"doi-asserted-by":"crossref","unstructured":"M.R. Garey, D.S. Johnson and L. Stockmayer, Some simplified NP-complete graph problems, Theor. Comput. Sci., 1 (1976)","key":"51_CR3","DOI":"10.1016\/0304-3975(76)90059-1"},{"key":"51_CR4","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1017\/S0305004100051124","volume":"77","author":"G. R. Grimmett","year":"1975","unstructured":"G.R. Grimmett and C.J.H. McDiarmid, On colouring random graphs, Math. Proc. Cambridge Philos. Soc. 77 (1975), 313\u2013324.","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"51_CR5","first-page":"513","volume-title":"Worst case behavior of graph coloring algorithms","author":"D. S. Johnson","year":"1974","unstructured":"D.S. Johnson, Worst case behavior of graph coloring algorithms, Proc. of the Fifth Southeastern Conf. on Combinatorics, Graph Theory and Computing, Utilitas Mathematica Publishing, Winipeg, Canada, 1974, 513\u2013528."},{"key":"51_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"R.M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, Eds., Plennum Press, New York, 1972, 85\u2013104."},{"key":"51_CR7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/B978-1-4832-3187-7.50015-5","volume-title":"Graph Theory and Computing","author":"D. M. Matula","year":"1972","unstructured":"D.M. Matula, G. Marble and J.D. Isaacson, Graph coloring algorithms, in Graph Theory and Computing, R.C. Read, Ed., Academic Press, New York, 1972, 109\u2013122."},{"issue":"3","key":"51_CR8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1008293.1008294","volume":"5","author":"L. Stockmayer","year":"1973","unstructured":"L. Stockmayer, Planar 3-colorability is polynomial complete, ACM SIGACT News, 5, 3 (1973), 19\u201325.","journal-title":"ACM SIGACT News"},{"key":"51_CR9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"D. J. A. A. Welsh","year":"1967","unstructured":"D.J.A. Welsh and M.B. Powell, An upper bound to the chromatic number of a graph and its application to time tabeling problems, Comput. J. 10 (1967), 85\u201386.","journal-title":"Comput. J."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08442-8_114.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:52:24Z","timestamp":1619542344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08442-8_114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"ISBN":["9783540084426","9783540370840"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-08442-8_114","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1977]]}}}