{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:36:08Z","timestamp":1729618568814,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1109\/hipc.2011.6152726","type":"proceedings-article","created":{"date-parts":[[2012,2,22]],"date-time":"2012-02-22T15:27:21Z","timestamp":1329924441000},"page":"1-10","source":"Crossref","is-referenced-by-count":5,"title":["Improving graph coloring on distributed-memory parallel computers"],"prefix":"10.1109","author":[{"given":"Ahmet Erdem","family":"Sariyuce","sequence":"first","affiliation":[]},{"given":"Erik","family":"Saule","sequence":"additional","affiliation":[]},{"given":"Umit V.","family":"Catalyurek","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/32.5.474"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/24.1.85"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/352\/06369"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/B978-1-4832-3187-7.50015-5","article-title":"Graph coloring algorithms","author":"matula","year":"1972","journal-title":"Graph Theory and Computing"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90005-3"},{"key":"ref15","first-page":"92","article-title":"Iterated greedy graph coloring and the difficulty landscape","author":"culberson","year":"1992","journal-title":"University of Alberta Tech Rep"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/10.1.85"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1007\/978-3-540-27866-5_107","article-title":"Distributed largest-first algorithm for graph coloring","volume":"3149","author":"hansen","year":"2004","journal-title":"Euro-Par 2004 Parallel Processing"},{"key":"ref18","first-page":"10","article-title":"Parallel graph coloring algorithms using OpenMP (extended abstract)","author":"gebremedhin","year":"0","journal-title":"First European Workshop on OpenMP"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190080115"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/872726.806984","article-title":"Register allocation & spilling via graph coloring","volume":"17","author":"chaitin","year":"1982","journal-title":"SIGPLAN Not"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/T-VT.1986.24063"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0720013"},{"key":"ref5","article-title":"A comparison of parallel graph coloring algorithms","author":"allwright","year":"1994","journal-title":"Northeast Parallel Architectures Center at Syracuse University (NPAC) Tech Rep"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2007.v003a006"},{"key":"ref7","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":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1976.1084138"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.08.002"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144504444711"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/0914041"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0117"},{"key":"ref24","article-title":"ParMETIS: Parallel graph partitioning and sparse matrix ordering library","author":"karypis","year":"2003","journal-title":"Dept Computer Science University of Minnesota Tech Rep"},{"key":"ref23","first-page":"2007","author":"boman","year":"2007","journal-title":"Zoltan 3 0 Parallel Partitioning Load Balancing and Data-Management Services User's Guide"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1065895.1065899"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2"}],"event":{"name":"2011 18th International Conference on High Performance Computing (HiPC)","start":{"date-parts":[[2011,12,18]]},"location":"Bangalore","end":{"date-parts":[[2011,12,21]]}},"container-title":["2011 18th International Conference on High Performance Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6146509\/6152423\/06152726.pdf?arnumber=6152726","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T23:37:58Z","timestamp":1561333078000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6152726\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/hipc.2011.6152726","relation":{},"subject":[],"published":{"date-parts":[[2011,12]]}}}