{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:28:56Z","timestamp":1725568136823},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290674"},{"type":"electronic","value":"9783540334989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11558958_130","type":"book-chapter","created":{"date-parts":[[2006,2,23]],"date-time":"2006-02-23T15:02:16Z","timestamp":1140706936000},"page":"1079-1088","source":"Crossref","is-referenced-by-count":4,"title":["Speeding up Parallel Graph Coloring"],"prefix":"10.1007","author":[{"given":"Assefaw H.","family":"Gebremedhin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fredrik","family":"Manne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Woods","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"130_CR1","unstructured":"Allwright, J., Bordawekar, R., Coddington, P.D., Dincer, K., Martin, C.: A comparison of parallel graph coloring algorithms, NPAC technical report SCCS-666, Northeast Parallel Architectures Center at Syracuse University (1994)"},{"key":"130_CR2","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 Jacobianmatrices and graph coloring problems. SIAM J. Numer. Anal.\u00a01, 187\u2013209 (1983)","journal-title":"SIAM J. Numer. Anal."},{"key":"130_CR3","unstructured":"Crescenzi, P., Kann, V.: A compendium of NP optimization problems, \n                      \n                        http:\/\/www.nada.kth.se\/~viggo\/wwwcompendium\/"},{"key":"130_CR4","doi-asserted-by":"crossref","unstructured":"Cuthill, E., Mckee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of ACM NAT. Conf., pp. 157\u2013172 (1969)","DOI":"10.1145\/800195.805928"},{"key":"130_CR5","unstructured":"Finocchi, A., Panconesi, R.: Experimental analysis of simple, distributed vertex coloring algorithms. In: Proc. 13th ACM-SIAM symposium on Discrete Algorithms, SODA 2002 (2002)"},{"key":"130_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":"130_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.H. Gebremedhin","year":"2002","unstructured":"Gebremedhin, A.H., 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":"130_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":"H. Gebremedhin","year":"2000","unstructured":"Gebremedhin, H., Manne, F.: Scalable parallel graph coloring algorithms. Concurrency: Practice and Experience\u00a012, 1131\u20131146 (2000)","journal-title":"Concurrency: Practice and Experience"},{"key":"130_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. Dist. Comput.\u00a037, 171\u2013186 (1996)","journal-title":"J. Par. Dist. Comput."},{"key":"130_CR10","volume-title":"Introduction to Parallel Computing","author":"A. Grama","year":"2003","unstructured":"Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing, 2nd edn. Addison Wesley, Reading (2003)","edition":"2"},{"key":"130_CR11","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. Inf. Proc. Letters\u00a070, 229\u2013232 (1999)","journal-title":"Inf. Proc. Letters"},{"key":"130_CR12","doi-asserted-by":"crossref","unstructured":"Jones, M.T., Plassman, P.: A parallel graph coloring heuristic. SIAMJ. Sci. Comput., 654\u2013669 (1993)","DOI":"10.1137\/0914041"},{"key":"130_CR13","unstructured":"Karypis, G.: Private communications"},{"key":"130_CR14","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way partitioning scheme for irregular graphs. J. Par. Dist. Comp.\u00a048, 96\u2013129 (1998)","journal-title":"J. Par. Dist. Comp."},{"key":"130_CR15","doi-asserted-by":"crossref","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput., 1036\u20131053 (1986)","DOI":"10.1137\/0215074"},{"key":"130_CR16","volume-title":"Introduction to Probability Models","author":"S.M. Ross","year":"2000","unstructured":"Ross, S.M.: Introduction to Probability Models, 7th edn. Academic Press, London (2000)","edition":"7"}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing. State of the Art in Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11558958_130.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:10:43Z","timestamp":1619507443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11558958_130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540290674","9783540334989"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11558958_130","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}