{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:34:11Z","timestamp":1755999251535,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662480953"},{"type":"electronic","value":"9783662480960"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48096-0_32","type":"book-chapter","created":{"date-parts":[[2015,7,24]],"date-time":"2015-07-24T06:16:03Z","timestamp":1437718563000},"page":"414-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A Fast and Scalable Graph Coloring Algorithm for Multi-core and Many-core Architectures"],"prefix":"10.1007","author":[{"given":"Georgios","family":"Rokos","sequence":"first","affiliation":[]},{"given":"Gerard","family":"Gorman","sequence":"additional","affiliation":[]},{"given":"Paul H.J.","family":"Kelly","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,25]]},"reference":[{"issue":"10\u201311","key":"32_CR1","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1016\/j.parco.2012.07.001","volume":"38","author":"\u00dcV \u00c7ataly\u00fcrek","year":"2012","unstructured":"\u00c7ataly\u00fcrek, \u00dc.V., Feo, J., Gebremedhin, A.H., Halappanavar, M., Pothen, A.: Graph coloring algorithms for multi-core and massively multithreaded architectures. Parallel Comput. 38(10\u201311), 576\u2013594 (2012)","journal-title":"Parallel Comput."},{"issue":"1","key":"32_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1132952.1132954","volume":"38","author":"D Chakrabarti","year":"2006","unstructured":"Chakrabarti, D., Faloutsos, C.: Graph mining: laws, generators, and algorithms. ACM Comput. Surv. 38(1), 2 (2006)","journal-title":"ACM Comput. Surv."},{"key":"32_CR3","unstructured":"Cohen, J., Castonguay, P.: Efficient Graph Matching and Coloring on the GPU. \n                      http:\/\/on-demand.gputechconf.com\/gtc\/2012\/presentations\/S0332-Efficient-Graph-Matching-and-Coloring-on-GPUs.pdf"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Coleman, T., Mor\u00e9, J.: Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J. Numer. Anal. 20(1), 187\u2013209 (1983). \n                      http:\/\/dx.doi.org\/10.1137\/0720013","DOI":"10.1137\/0720013"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1:1\u20131:25, December 2011. \n                      http:\/\/doi.acm.org\/10.1145\/2049662.2049663","DOI":"10.1145\/2049662.2049663"},{"issue":"7","key":"32_CR6","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1002\/(SICI)1097-0207(19991110)46:7<1101::AID-NME741>3.0.CO;2-E","volume":"46","author":"H Cougny De","year":"1999","unstructured":"De Cougny, H., Shephard, M.S.: Parallel refinement and coarsening of tetrahedral meshes. Int. J. Numer. Meth. Eng. 46(7), 1101\u20131125 (1999)","journal-title":"Int. J. Numer. Meth. Eng."},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Freitag, L.F., Jones, M.T., Plassmann, P.E.: The scalability of mesh improvement algorithms. In: Algorithms for Parallel Processing IMA Volumes in Mathematics And Its Applications, pp. 185\u2013 212. Springer-Verlag (1998)","DOI":"10.1007\/978-1-4612-1516-5_9"},{"key":"32_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Gebremedhin, A.H., Manne, F.: Scalable parallel graph coloring algorithms. Concurrency: Pract. Experience 12(12), 1131\u20131146 (2000). \n                      http:\/\/dx.doi.org\/10.1002\/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2","DOI":"10.1002\/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Gorman, G.J., Rokos, G., Southern, J., Kelly, P.H.J.: Thread-parallel anisotropic mesh adaptation. Accepted for Publication in Proceedings of the 4th Tetrahedron Workshop on Grid Generation for Numerical Computations (2015)","DOI":"10.1007\/978-3-319-06053-8_6"},{"key":"32_CR11","unstructured":"Hasenplaugh, W., Kaler, T., Schardl, T.B., Leiserson, C.E.: Ordering heuristics for parallel graph coloring. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2014, pp. 166\u2013177. ACM, New York (2014). \n                      http:\/\/doi.acm.org\/10.1145\/2612669.2612697"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Hysom, D., Pothen, A.: A scalable parallel algorithm for incomplete factor preconditioning. SIAM J. Sci. Comput. 22(6), 2194\u20132215, June 2000. \n                      http:\/\/dx.doi.org\/10.1137\/S1064827500376193","DOI":"10.1137\/S1064827500376193"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1137\/0914041","volume":"14","author":"MT Jones","year":"1992","unstructured":"Jones, M.T., Plassmann, P.E.: A parallel graph coloring heuristic. SIAM J. Sci. Comput 14, 654\u2013669 (1992)","journal-title":"SIAM J. Sci. Comput"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Jones, M.T., Plassmann, P.E.: Scalable iterative solution of sparse linear systems. Parallel Comput. 20(5), 753\u2013773, May 1994. \n                      http:\/\/dx.doi.org\/10.1016\/0167-8191(94)90004-3","DOI":"10.1016\/0167-8191(94)90004-3"},{"key":"32_CR15","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC 1985, pp. 1\u201310. ACM, New York (1985). \n                      http:\/\/doi.acm.org\/10.1145\/22145.22146"},{"key":"32_CR16","unstructured":"Manne, F.: A parallel algorithm for computing the extremal eigenvalues of very large sparse matrices. In: Proceedings of the 4th International Workshop on Applied Parallel Computing, Large Scale Scientific and Industrial Problems, PARA 1998, pp. 332\u2013336. Springer, London (1998). \n                      http:\/\/dl.acm.org\/citation.cfm?id=645781.666669"},{"key":"32_CR17","unstructured":"Nasre, R., Burtscher, M., Pingali, K.: Morph algorithms on GPUs. In: Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2013, pp. 147\u2013156. ACM, New York (2013). \n                      http:\/\/iss.ices.utexas.edu\/Publications\/Papers\/nasre13-ppopp.pdf"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Saad, Y.: ILUM: a multi-elimination ILU preconditioner for general sparse matrices. SIAM J. Sci. Comput. 17(4), 830\u2013847 (1996). \n                      http:\/\/dx.doi.org\/10.1137\/0917054","DOI":"10.1137\/0917054"},{"key":"32_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/11596110_7","volume-title":"Languages and Compilers for Parallel Computing","author":"MM Strout","year":"2005","unstructured":"Strout, M.M., Carter, L., Ferrante, J., Freeman, J., Kreaseck, B.: Combining performance aspects of irregular gauss-seidel via sparse tiling. In: Pugh, B., Tseng, C.-W. (eds.) LCPC 2002. LNCS, vol. 2481, pp. 90\u2013110. Springer, Heidelberg (2005)"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Strout, M.M., Luporini, F., Krieger, C.D., Bertolli, C., Bercea, G.T., Olschanowsky, C., Ramanujam, J., Kelly, P.H.J.: Generalizing run-time tiling with the loop chain abstraction. In: Proceedings of the 28th IEEE International Parallel and Distributed Processing Symposium (IPDPS), May 2014","DOI":"10.1109\/IPDPS.2014.118"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2015: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48096-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:34:15Z","timestamp":1587342855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48096-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480953","9783662480960"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48096-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"25 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}