{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:14Z","timestamp":1725488954223},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540411833"},{"type":"electronic","value":"9783540400646"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40064-8_18","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:25:42Z","timestamp":1186892742000},"page":"184-195","source":"Crossref","is-referenced-by-count":2,"title":["Graph Coloring on a Coarse Grained Multiprocessor (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Assefaw Hadish","family":"Gebremedhin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isabelle Gu\u00e9rin","family":"Lassous","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Gustedt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"18_CR1","unstructured":"J. R. Allwright, R. Bordawekar, P. D. Coddington, K. Dincer, and C. L. Martin. A comparison of parallel graph coloring algorithms. Technical Report SCCS-666, Northeast Parallel Architecture Center, Syracuse University, 1995."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a Realistic Model of Parallel Computation. In Proceeding of 4-th ACM SIGPLAN Symp. on Principles and Practises of Parallel Programming, pages 1\u201312, 1993.","DOI":"10.1145\/155332.155333"},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1142\/S0218195996000241","volume":"6","author":"F. Dehne","year":"1996","unstructured":"F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel computational geometry for coarse grained multicomputers. International Journal on Computational Geometry, 6(3):379\u2013400, 1996.","journal-title":"International Journal on Computational Geometry"},{"key":"18_CR4","unstructured":"Assefaw Hadish Gebremedhin and Fredrik Manne. Parallel graph coloring algorithms using OpenMP (extended abstract). In First European Workshop on OpenMP, pages 10\u201318, Lund, Sweden, September 30-October 1, 1999."},{"key":"18_CR5","unstructured":"Assefaw Hadish Gebremedhin and Fredrik Manne. Scalable, shared memory parallel graph coloring heuristics. Technical Report 181, Department of Informatics, University of Bergen, 5020 Bergen, Norway, December 1999."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"M. Goudreau, K. Lang, S. Rao, T. Suel, and T. Tsantilas. Towards efficiency and portability: Programming with the BSP model. In 8th Annual ACM symposium on Parallel Algorithms and Architectures (SPAA\u201996), pages 1\u201312, 1996.","DOI":"10.1145\/237502.237503"},{"key":"18_CR7","unstructured":"Isabelle Gu\u00e9rin Lassous, Jens Gustedt, and Michel Morvan. Feasability, portability, predictability and e_ciency: Four ambitious goals for the design and implementation of parallel coarse grained graph algorithms. Technical report, INRIA, 2000."},{"issue":"8","key":"18_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L. G. Valiant","year":"1990","unstructured":"Leslie G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103\u2013111, 1990.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40064-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:40:00Z","timestamp":1556754000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40064-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411833","9783540400646"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-40064-8_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}