{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:59:51Z","timestamp":1774367991617,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540290315","type":"print"},{"value":"9783540320791","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11557654_90","type":"book-chapter","created":{"date-parts":[[2005,10,4]],"date-time":"2005-10-04T09:59:18Z","timestamp":1128419958000},"page":"796-806","source":"Crossref","is-referenced-by-count":19,"title":["A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers"],"prefix":"10.1007","author":[{"given":"Doruk","family":"Bozda\u011f","sequence":"first","affiliation":[]},{"given":"Umit","family":"Catalyurek","sequence":"additional","affiliation":[]},{"given":"Assefaw H.","family":"Gebremedhin","sequence":"additional","affiliation":[]},{"given":"Fredrik","family":"Manne","sequence":"additional","affiliation":[]},{"given":"Erik G.","family":"Boman","sequence":"additional","affiliation":[]},{"given":"F\u00fcsun","family":"\u00d6zg\u00fcner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"90_CR1","doi-asserted-by":"crossref","unstructured":"Gebremedhin, A.H., Manne, F., Pothen, A.: What color is your jacobian? Graph coloring for computing derivatives. SIAM Rev (2005) (to appear)","DOI":"10.1137\/S0036144504444711"},{"key":"90_CR2","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1023\/A:1012311216333","volume":"7","author":"S.O. Krumke","year":"2001","unstructured":"Krumke, S.O., Marathe, M.V., Ravi, S.S.: Models and approximation algorithms for channel assignment in radio networks. Wireless Networks\u00a07, 575\u2013584 (2001)","journal-title":"Wireless Networks"},{"key":"90_CR3","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"},{"key":"90_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1023\/A:1026158611840","volume":"24","author":"A. Ferreira","year":"2003","unstructured":"Ferreira, A., P\u00e9rennes, S., Richa, A.W., Rivano, H., Stier, N.: Models, complexity and algorithms for the design of multi-fiber wdm networks. Telecommunication Systems\u00a024, 123\u2013138 (2003)","journal-title":"Telecommunication Systems"},{"key":"90_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02592052","volume":"26","author":"S.T. McCormick","year":"1983","unstructured":"McCormick, S.T.: Optimal approximation of sparse hessians and its equivalence to a graph coloring problem. Math. Programming\u00a026, 153\u2013171 (1983)","journal-title":"Math. Programming"},{"key":"90_CR6","doi-asserted-by":"crossref","unstructured":"Boman, E.G., Bozda\u011f, D., Catalyurek, U., Gebremedhin, A.H., Manne, F.: A scalable parallel graph coloring algorithm for distributed memory computers. In: EuroPar (2005) (to appear)","DOI":"10.1007\/11549468_29"},{"key":"90_CR7","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":"90_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1007\/11558958_130","volume-title":"Applied Parallel Computing. State of the Art in Scientific Computing","author":"A.H. Gebremedhin","year":"2006","unstructured":"Gebremedhin, A.H., Manne, F., Woods, T.: Speeding up parallel graph coloring. In: Dongarra, J., Madsen, K., Wa\u015bniewski, J. (eds.) PARA 2004. LNCS, vol.\u00a03732, pp. 1079\u20131088. Springer, Heidelberg (2006)"},{"key":"90_CR9","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. SIAM-SC\u00a014, 654\u2013669 (1993)","journal-title":"SIAM-SC"},{"key":"90_CR10","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":"90_CR11","unstructured":"Test data from the parasol project, http:\/\/www.parallab.uib.no\/projects\/parasol\/data\/"},{"key":"90_CR12","unstructured":"University of florida matrix collection, http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/"},{"key":"90_CR13","doi-asserted-by":"crossref","unstructured":"Strout, M.M., Hovland, P.D.: Metrics and models for reordering transformations. In: Proceedings of MSP 2004, pp. 23\u201334 (2004)","DOI":"10.1145\/1065895.1065899"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing and Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11557654_90","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T16:47:22Z","timestamp":1553618842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11557654_90"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290315","9783540320791"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11557654_90","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}