{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:29:56Z","timestamp":1725568196940},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287001"},{"type":"electronic","value":"9783540319252"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549468_29","type":"book-chapter","created":{"date-parts":[[2010,10,25]],"date-time":"2010-10-25T13:18:34Z","timestamp":1288012714000},"page":"241-251","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers"],"prefix":"10.1007","author":[{"given":"Erik G.","family":"Boman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doruk","family":"Bozda\u011f","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Umit","family":"Catalyurek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Assefaw H.","family":"Gebremedhin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fredrik","family":"Manne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Allwright, J.R., Bordawekar, R., Coddington, P.D., Dincer, K., Martin, C.L.: A comparison of parallel graph coloring algorithms. Technical Report NPAC technical report SCCS-666, Northeast Parallel Architectures Center at Syracuse University (1994)"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Bisseling, R.H.: Parallel Scientific Computation: A Structured Approach Using BSP and MPI. Oxford (2004)","DOI":"10.1093\/acprof:oso\/9780198529392.001.0001"},{"issue":"20","key":"29_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/0720013","volume":"1","author":"T.F. Coleman","year":"1983","unstructured":"Coleman, T.F., More, J.J.: Estimation of sparse jacobian matrices and graph coloring problems. SIAM J. Numer. Anal.\u00a01(20), 187\u2013209 (1983)","journal-title":"SIAM J. Numer. Anal."},{"key":"29_CR4","unstructured":"Crescenzi, P., Kann, V.: A compendium of NP optimization problems, \n                    \n                      http:\/\/www.nada.kth.se\/~viggo\/wwwcompendium\/"},{"key":"29_CR5","unstructured":"Finocchi, I., Panconesi, A., Silvestri, R.: Experimental analysis of simple, distributed vertex coloring algorithms. In: Proc. 13th ACM-SIAMsymposium on Discrete Algorithms, SODA 2002 (2002)"},{"key":"29_CR6","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1007\/3-540-45706-2_130","volume-title":"Euro-Par 2002. Parallel Processing","author":"A. Gebremedhin","year":"2002","unstructured":"Gebremedhin, A., Manne, F., Pothen, A.: Parallel distance-k coloring algorithms for numerical optimization. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol.\u00a02400, pp. 912\u2013921. Springer, Heidelberg (2002)"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1002\/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2","volume":"12","author":"A.H. Gebremedhin","year":"2000","unstructured":"Gebremedhin, A.H., Manne, F.: Scalable parallel graph coloring algorithms. Concurrency: Practice and Experience\u00a012, 1131\u20131146 (2000)","journal-title":"Concurrency: Practice and Experience"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1006\/jpdc.1996.0117","volume":"37","author":"R.K. Gjertsen Jr.","year":"1996","unstructured":"Gjertsen Jr., R.K., Jones, M.T., Plassmann, P.: Parallel heuristics for improved, balanced graph colorings. J. Par. and Dist. Comput.\u00a037, 171\u2013186 (1996)","journal-title":"J. Par. and Dist. Comput."},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0020-0190(99)00064-2","volume":"70","author":"\u00d6. Johansson","year":"1999","unstructured":"Johansson, \u00d6.: Simple distributed \u03b4 + 1-coloring of graphs. Information Processing Letters\u00a070, 229\u2013232 (1999)","journal-title":"Information Processing Letters"},{"issue":"3","key":"29_CR11","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1137\/0914041","volume":"14","author":"M.T. Jones","year":"1993","unstructured":"Jones, M.T., Plassmann, P.: A parallel graph coloring heuristic. SIAMJ. Sci. Comput.\u00a014(3), 654\u2013669 (1993)","journal-title":"SIAMJ. Sci. Comput."},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput.\u00a020(1) (1999)","DOI":"10.1137\/S1064827595287997"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Strout, M.M., Hovland, P.D.: Metrics and models for reordering transformations. In: Proceedings of the The Second ACM SIGPLAN Workshop on Memory System Performance (MSP), June 8, pp. 23\u201334 (2004)","DOI":"10.1145\/1065895.1065899"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2005 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549468_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T20:16:56Z","timestamp":1587327416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549468_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287001","9783540319252"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11549468_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}