{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:10:33Z","timestamp":1736104233784,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540611431"},{"type":"electronic","value":"9783540683322"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":[[1996]]},"DOI":"10.1007\/bfb0023062","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T06:32:44Z","timestamp":1132381964000},"page":"190-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient parallel graph coloring with prioritization"],"prefix":"10.1007","author":[{"given":"Laxmikant V.","family":"Kale","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ben H.","family":"Richards","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Terry D.","family":"Allen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"D. Br\u00e9laz. New methods to color the vertices of a graph. Communications of the ACM, 22:251\u2013256, 1979.","journal-title":"Communications of the ACM"},{"issue":"3","key":"10_CR2","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1145\/177492.177575","volume":"16","author":"P. Briggs","year":"1994","unstructured":"Preston Briggs, Keith D. Cooper, and Linda Torczon. Improvements to graph coloring register allocation. ACM Transactions on Programming Languages and Systems, 16(3):428\u2013455, May 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/S0377-2217(87)80148-0","volume":"32","author":"M. Chams","year":"1987","unstructured":"M. Chams, A. Hertz, and D. de Werra. Some experiments with simulated annealing for coloring graphs. European Journal of Operational Research, Vol. 32,:, pages 260\u2013266, 1987.","journal-title":"European Journal of Operational Research"},{"key":"10_CR4","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 Journal on Numerical Analysis, 20:187\u2013209, 1983.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"10_CR5","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability. W.H. Freeman, New York, 1979."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"R. Halstead. Parallel symbolic computing. IEEE Computer, pages 35\u201343, August 1986.","DOI":"10.1109\/MC.1986.1663306"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1987","unstructured":"A. Hertz and D. de Werra. Using tabu search techniques for graph coloring. Computing, Vol. 39,:, pages 345\u2013351, 1987.","journal-title":"Computing"},{"issue":"3","key":"10_CR8","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1137\/0914041","volume":"14","author":"M. T. Jones","year":"1993","unstructured":"Mark T. Jones and Paul E. Plassmann. A parallel graph coloring heuristic. SIAM J. Sci. Statist. Comput., 14(3):654\u2013669, May 1993.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1016\/0167-8191(94)90004-3","volume":"20","author":"M.T. Jones","year":"1994","unstructured":"M.T. Jones and P.E. Plassmann. Scalable iterative solution of sparse linear systems. Parallel Computing, 20:753\u2013773, 1994.","journal-title":"Parallel Computing"},{"key":"10_CR10","volume-title":"Technical report","author":"R.K. Gjertsen Jr.","year":"1994","unstructured":"R.K. Gjertsen Jr. Parallel graph coloring heuristics. Technical report, University of Illinois at Urbana-Champaign, 1994. Master's Thesis, Dept. of Computer Sceince."},{"key":"10_CR11","first-page":"17","volume":"II","author":"L. V. Kale","year":"1990","unstructured":"L. V. Kale. The Chare Kernel parallel programming language and system. In Proceedings of the International Conference on Parallel Processing, volume II, pages 17\u201325, 1990.","journal-title":"Proceedings of the International Conference on Parallel Processing"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"L.V. Kale. Parallel problem solving. In Vipin Kumar, P. S. Gopolakrishnan, and L. N. Kanal, editors, Parallel Algorithms for Machine Intelligence and Vision, pages 146\u2013181. Springer-Verlag, 1989.","DOI":"10.1007\/978-1-4612-3390-9_5"},{"key":"10_CR13","first-page":"12","volume":"748","author":"L.V. Kale","year":"1993","unstructured":"L.V. Kale, B. Ramkumar, V. Saletore, and A.B. Sinha. Prioritization in parallel symbolic computing. Lecture Notes in Computer Science, 748:12\u201341, 1993.","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"G. J. Li and B.W. Wah. Coping with anomalies in parallel branch-and-bound algorithms. In IEEE Transactions on Computers, pages 568\u2013573, June 1986.","DOI":"10.1109\/TC.1986.5009434"},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/45054.214373","volume":"14","author":"R.G. Melhem","year":"1988","unstructured":"R.G. Melhem and V.S. Ramarao. Multicolor reorderings of sparse matrices resulting from irregular grids. ACM Transactions on Mathematical Software, 14:117\u2013138, 1988.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"10_CR16","volume-title":"The Four-Color Problem","author":"O. Ore","year":"1967","unstructured":"O. Ore. The Four-Color Problem. Academic Press, New York, 1967."},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1137\/0801034","volume":"1","author":"J.M. Ortega","year":"1991","unstructured":"J.M. Ortega. Orderings for conjugate gradient preconditionings. SIAM Journal on Optimization, 1:565\u2013582, 1991.","journal-title":"SIAM Journal on Optimization"},{"key":"10_CR18","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1137\/0913011","volume":"13","author":"C. Pommerell","year":"1992","unstructured":"C. Pommerell, M. Annaratone, and W. Fichtner. A set of new mapping and coloring heuristics for distributed-memory parallel processors. SIAM Journal on Scientific and Statistical Computing, 13:194\u2013226, 1992.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"10_CR19","volume-title":"Technical report","author":"B. Richards","year":"1994","unstructured":"B. Richards. Parallel graph coloring with Charm. Technical report, University of Illinois at Urbana-Champaign, 1994. Master's Thesis, Dept. of Computer Science."},{"key":"10_CR20","unstructured":"V. Saletore and L.V. Kale. Consistent linear speedups for a first solution in parallel state-space search. In Proceedings of the AAAI, pages 227\u2013233, August 1990."},{"key":"10_CR21","volume-title":"Technical report","author":"V.A. Saletore","year":"1990","unstructured":"V.A. Saletore. Machine independent parallel execution of speculative computations. Technical report, University of Illinois, Urbana, Illinois, 1990. PhD Thesis, Dept. of Computer Sceince."},{"key":"10_CR22","unstructured":"A. Sinha, L.V. Kale, and B. Ramkumar. A dynamic and adaptive quiescence detection algorithm. Technical Report 93-11, Parallel Programming Laboratory, Department of Computer Science, University of Illinois, 1993."},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Amitabh Sinha and L.V. Kale. A load balancing strategy for prioritized execution of tasks. In Seventh International Parallel Processing Symposium, pages 230\u2013237, Newport Beach, CA., April 1993.","DOI":"10.1109\/IPPS.1993.262887"},{"key":"10_CR24","first-page":"551","volume":"I","author":"M. Wu","year":"1990","unstructured":"M. Wu and W. Shu. A dynamic program partitioning strategy on distributed memory systems. In Proceedings of the International Conference on Parallel Processing, volume I, pages 551\u2013552, 1990.","journal-title":"Proceedings of the International Conference on Parallel Processing"}],"container-title":["Lecture Notes in Computer Science","Parallel Symbolic Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023062","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T18:54:27Z","timestamp":1736103267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611431","9783540683322"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/bfb0023062","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"10 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}