{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:38:44Z","timestamp":1725493124441},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440499"},{"type":"electronic","value":"9783540457060"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45706-2_130","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T01:37:18Z","timestamp":1191721038000},"page":"912-921","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Parallel Distance-k Coloring Algorithms for Numerical Optimization"],"prefix":"10.1007","author":[{"given":"Assefaw Hadish","family":"Gebremedhin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fredrik","family":"Manne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Pothen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,20]]},"reference":[{"issue":"1","key":"130_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/0720013","volume":"20","author":"T. F. Coleman","year":"1983","unstructured":"T. F. Coleman and J. J. Mor\u00e9. Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J. Numer. Anal., 20(1):187\u2013209, February 1983.","journal-title":"SIAM J. Numer. Anal."},{"key":"130_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF02612334","volume":"28","author":"T. F. Coleman","year":"1984","unstructured":"T. F. Coleman and J. J. Mor\u00e9. Estimation of sparse Hessian matrices and graph coloring problems. Math. Program., 28:243\u2013270, 1984.","journal-title":"Math. Program."},{"issue":"4","key":"130_CR3","doi-asserted-by":"crossref","first-page":"1210","DOI":"10.1137\/S1064827595295349","volume":"19","author":"T. F. Coleman","year":"1998","unstructured":"T. F. Coleman and A. Verma. The efficient computation of sparse Jacobian matrices using automatic differentiation. SIAM J. Sci. Comput., 19(4):1210\u20131233, July 1998.","journal-title":"SIAM J. Sci. Comput."},{"unstructured":"I. Finocchi, A. Panconesi, and R. Silvestri. Experimental analysis of simple, distributed vertex coloring algorithms. In Proceedings of the Thirteenth ACM-SIAM Symposium on Discrete Algorithms (SODA 02), San Francisco, CA, 2002.","key":"130_CR4"},{"key":"130_CR5","first-page":"1131","volume":"12","author":"A. H. Gebremedhin","year":"2000","unstructured":"A. H. Gebremedhin and F. Manne. Scalable parallel graph coloring algorithms. Concurrency: Pract. Exper., 12:1131\u20131146, 2000.","journal-title":"Scalable parallel graph coloring algorithms. Concurrency: Pract. Exper."},{"key":"130_CR6","volume-title":"Technical Report 226","author":"A. H. Gebremedhin","year":"2002","unstructured":"A. H. Gebremedhin, F. Manne, and A. Pothen. Graph coloring in optimization revisited. Technical Report 226, University of Bergen, Dept. of Informatics, Norway, January 2002. Available at: http:\/\/www.ii.uib.no\/publikasjoner\/texrap\/ ."},{"key":"130_CR7","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","volume-title":"Limits to Parallel Computation: P-Completeness Theory","author":"R. Greenlaw","year":"1995","unstructured":"R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, New York, 1995."},{"key":"130_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1080\/10556789808805700","volume":"10","author":"A.K.M.S. Hossain","year":"1998","unstructured":"A.K.M.S. Hossain and T. Steihaug. Computing a sparse Jacobian matrix by rows and columns. Optimization Methods and Software, 10:33\u201348, 1998.","journal-title":"Optimization Methods and Software"},{"issue":"3","key":"130_CR9","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1137\/0914041","volume":"14","author":"M. T. Jones","year":"1993","unstructured":"M. T. Jones and P. E. Plassmann. A parallel graph coloring heuristic. SIAM J. Sci. Comput., 14(3):654\u2013669, May 1993.","journal-title":"SIAM J. Sci. Comput."},{"unstructured":"S. O. Krumke, M. V. Marathe, and S. S. Ravi. Approximation algorithms for channel assignment in radio networks. In DIAL M for Mobility, Dallas, Texas, 1998.","key":"130_CR10"},{"key":"130_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02592052","volume":"26","author":"S. T. McCormick","year":"1983","unstructured":"S. T. McCormick. Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem. Math. Program., 26:153\u2013171, 1983.","journal-title":"Math. Program."},{"unstructured":"V. V. Vazirani. Approximation Algorithms. Springer, 2001. Chapter 5.","key":"130_CR12"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2002 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45706-2_130","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,25]],"date-time":"2021-08-25T04:42:44Z","timestamp":1629866564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45706-2_130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440499","9783540457060"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45706-2_130","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"20 August 2002","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"}]}}