{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:00:16Z","timestamp":1729630816160,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1109\/icpp.2017.59","type":"proceedings-article","created":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T16:35:37Z","timestamp":1504802137000},"page":"503-512","source":"Crossref","is-referenced-by-count":6,"title":["Greed Is Good: Parallel Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures"],"prefix":"10.1109","author":[{"given":"Mustafa Kemal","family":"Tas","sequence":"first","affiliation":[]},{"given":"Kamer","family":"Kaya","sequence":"additional","affiliation":[]},{"given":"Erik","family":"Saule","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"IPDPSW Workshop on Parallel Computing and Optimization (PCO)","article-title":"Scalable hybrid implementation of graph coloring using MPI and OpenMP","year":"2012","author":"sarly\u00fcce","key":"ref32"},{"key":"ref31","first-page":"10","article-title":"Parallel graph coloring algorithms using OpenMP (extended abstract)","author":"gebremedhin","year":"1999","journal-title":"First European Workshop on OpenMP"},{"journal-title":"On distributed graph coloring with iterative recoloring","year":"2014","author":"sarly\u00fcce","key":"ref30"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2307\/2319405"},{"key":"ref11","first-page":"601","article-title":"Proof of a conjecture of p. erdos","author":"hajnal","year":"1970","journal-title":"London North-Holland"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1006\/jpdc.1996.0117","article-title":"Parallel heuristics for improved, balanced graph colorings","volume":"37","author":"robert","year":"1996","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/j.parco.2012.07.001","article-title":"Graph coloring algorithms for multicore and massively multithreaded architectures","volume":"38","author":"\u00e7ataly\u00fcrek","year":"2012","journal-title":"Parallel Computing"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.54"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2012.216"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23397-5_24"},{"journal-title":"Improving parallel sparse matrix-vector multiplication","year":"2013","author":"tessem","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"journal-title":"GroupLens Research MovieLens Dataset","year":"0","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.08.002"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/0720013"},{"key":"ref27","first-page":"241","article-title":"A scalable parallel graph coloring algorithm for distributed memory computers","author":"boman","year":"2005","journal-title":"Proc of 11th Int'l Euro-Par Conf on Parallel Processing"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2513109.2513110"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/080732158"},{"journal-title":"18th Annual Int Conf on High Performance Comp","article-title":"Improving graph coloring on distributed memory parallel computers","year":"2011","author":"sarly\u00fcce","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/11557654_90"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1007\/3-540-45706-2_130","article-title":"Parallel distance-k coloring algorithms for numerical optimization","author":"gebremedhin","year":"2002","journal-title":"Euro-Par 2002 Parallel Processing-8th International Conference"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144504444711"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2007.v003a006"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.113"},{"key":"ref1","first-page":"481","article-title":"A min-max theorem for graphs with application to graph coloring","volume":"10","author":"matula","year":"1968","journal-title":"SIAM Review"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/10.1.85"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/0914041"},{"journal-title":"Northeast Parallel Architectures Center at Syracuse University (NPAC) Tech Rep SCCS-666","article-title":"A comparison of parallel graph coloring algorithms","year":"1994","author":"allwright","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0117"}],"event":{"name":"2017 46th International Conference on Parallel Processing (ICPP)","start":{"date-parts":[[2017,8,14]]},"location":"Bristol, United Kingdom","end":{"date-parts":[[2017,8,17]]}},"container-title":["2017 46th International Conference on Parallel Processing (ICPP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8023017\/8025263\/08025324.pdf?arnumber=8025324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T02:48:38Z","timestamp":1570070918000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8025324\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/icpp.2017.59","relation":{},"subject":[],"published":{"date-parts":[[2017,8]]}}}
