{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:38:45Z","timestamp":1725493125098},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003557"},{"type":"electronic","value":"9783540363859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36385-8_31","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T10:15:41Z","timestamp":1192875341000},"page":"312-318","source":"Crossref","is-referenced-by-count":0,"title":["Approximating the Range Sum of a Graph on CREW PRAM"],"prefix":"10.1007","author":[{"given":"Saurabh","family":"Srivastava","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phalguni","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"key":"31_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Efficient parallel graph coloring with prioritization","author":"L. V. Kale","year":"1996","unstructured":"L. V. Kale, Ben Richards, and Terry Allen. Efficient parallel graph coloring with prioritization. Lecture Notes in Computer Science, 1996."},{"key":"31_CR2","unstructured":"Gary Lewandowski and Anne Condon, Experiments with parallel graph coloring heuristics and applications of graph coloring, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, pp. 309\u2013334, 1993."},{"key":"31_CR3","unstructured":"Gary Lewandowski. Practical Implementations and Applications of Graph Coloring. PhD thesis, University of Wisconsin-Madison, August 1994."},{"issue":"1","key":"31_CR4","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/T-VT.1986.24063","volume":"35","author":"A. Gamst","year":"1986","unstructured":"Andreas Gamst. Some lower bounds for a class of frequency assignment problems. IEEE Transactions on Vehicular Technology, 35(1):8\u201314, 1986.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0096-0551(81)90048-5","volume":"6","author":"G. J. Chaitin","year":"1981","unstructured":"G. J. Chaitin, M. Auslander, A. K. Chandra, J. Cocke, M. E. Hopkins and P. Markstein. Register Allocation via coloring. Computer Languages, 6:47\u201357, 1981.","journal-title":"Computer Languages"},{"key":"31_CR6","unstructured":"S. Srivastava, S. Tripathi. Resource Optimization in CDMA based Wireless Ad Hoc Networks. BTP Report 2001-2002, Department of Computer Science and Engineering, IIT Kanpur."},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Ewa Kubicka and A. J. Schwenk, An Introduction to Chromatic Sums, Proc. of ACM Computer Science Conference, pp. 39\u201345, 1989.","DOI":"10.1145\/75427.75430"},{"key":"31_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":"A. Hadish Gebremedhin","year":"2000","unstructured":"Assefaw Hadish Gebremedhin and Fredrik Manne. Scalable Parallel Graph Coloring Algorithms, Concurrency: Pract. Exper. 2000, 12:1131\u20131146.","journal-title":"Concurrency: Pract. Exper"},{"key":"31_CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1006\/jpdc.1996.0117","volume":"37","author":"R. K. Gjertsen","year":"1996","unstructured":"Gjertsen, R. K., Jr., M. T. Jones, P. E. Plassmann. 1996. Parallel Heuristics for Improved, Balanced Graph Colorings. Journal of Parallel and Distributed Computing 37:171\u2013186.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"31_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1006\/jagm.1996.0836","volume":"23","author":"M. M. Halld\u00f3rsson","year":"1997","unstructured":"Magn\u00fas M. Halld\u00f3rsson. Parallel and on-line graph coloring. Journal of Algorithms, 23(2):265\u2013280, May 1997.","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36385-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T11:36:31Z","timestamp":1551008191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36385-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540003557","9783540363859"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-36385-8_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}