{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:56:13Z","timestamp":1747810573514},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642233968"},{"type":"electronic","value":"9783642233975"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23397-5_24","type":"book-chapter","created":{"date-parts":[[2011,8,18]],"date-time":"2011-08-18T07:40:06Z","timestamp":1313653206000},"page":"250-262","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["New Multithreaded Ordering and Coloring Algorithms for Multicore Architectures"],"prefix":"10.1007","author":[{"given":"Md. Mostofa Ali","family":"Patwary","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Assefaw H.","family":"Gebremedhin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Pothen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"2418","DOI":"10.1137\/080732158","volume":"32","author":"D. Bozda\u011f","year":"2010","unstructured":"Bozda\u011f, D., Catalyurek, U.V., Gebremedhin, A.H., Manne, F., Boman, E.G., Ozgunner, F.: Distributed-memory parallel algorithms for distance-2 coloring and related problems in derivative computation. SIAM J. Sci. Comput.\u00a032(4), 2418\u20132446 (2010)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"24_CR2","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.jpdc.2007.08.002","volume":"68","author":"D. Bozda\u011f","year":"2008","unstructured":"Bozda\u011f, D., Gebremedhin, A.H., Manne, F., Boman, E.G., Catalyurek, U.V.: A framework for scalable greedy coloring on distributed-memory parallel computers. Journal of Parallel and Distributed Computing\u00a068(4), 515\u2013535 (2008)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"24_CR3","unstructured":"Catalyurek, U., Feo, J., Gebremedhin, A.H., Halappanavar, M., Pothen, A.: Multithreaded algorithms for graph coloring. Submitted for Journal Publication (2011)"},{"issue":"1","key":"24_CR4","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.\u00a038(1), 2 (2006)","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"24_CR5","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1137\/S0036144504444711","volume":"47","author":"A.H. Gebremedhin","year":"2005","unstructured":"Gebremedhin, A.H., Manne, F., Pothen, A.: What color is your Jacobian? Graph coloring for computing derivatives. SIAM Review\u00a047(4), 629\u2013705 (2005)","journal-title":"SIAM Review"},{"key":"24_CR6","unstructured":"Gebremedhin, A.H., Nguyen, D., Patwary, M.M.A., Pothen, A.: ColPack: Graph coloring software for derivative computation and beyond. Submitted for Journal Publication (2010)"},{"issue":"5","key":"24_CR7","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/0167-8191(94)90004-3","volume":"20","author":"M.T. Jones","year":"1994","unstructured":"Jones, M.T., Plassmann, P.E.: Scalable iterative solution of sparse linear systems. Parallel Computing\u00a020(5), 753\u2013773 (1994)","journal-title":"Parallel Computing"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1137\/0917054","volume":"17","author":"Y. Saad","year":"1996","unstructured":"Saad, Y.: ILUM: A multi-elimination ILU preconditioner for general sparse matrices. SIAM J. Sci. Comput.\u00a017, 830\u2013847 (1996)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"24_CR9","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R.E. Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput.\u00a013(3), 566\u2013579 (1984)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2011 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23397-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:45:52Z","timestamp":1587343552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23397-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642233968","9783642233975"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23397-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}