{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T10:21:18Z","timestamp":1773224478751,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1109\/ipdps.2010.5470485","type":"proceedings-article","created":{"date-parts":[[2010,6,2]],"date-time":"2010-06-02T20:25:07Z","timestamp":1275510307000},"page":"1-12","source":"Crossref","is-referenced-by-count":59,"title":["Engineering a scalable high quality graph partitioner"],"prefix":"10.1109","author":[{"given":"Manuel","family":"Holtgrewe","sequence":"first","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1982.1585498"},{"key":"ref11","article-title":"Algorithms for graph partitioning: A survey","volume":"3","author":"fjallstrom","year":"1998","journal-title":"Linkoping Electronic Articles in Computer and Information Science"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972887.9"},{"key":"ref13","author":"hendrickson","year":"0","journal-title":"Chaco Software for Partitioning Graphs"},{"key":"ref14","first-page":"218","article-title":"Graph partitioning and parallel solvers: Has the emperor no clothes? (extended abstract)","author":"hendrickson","year":"1998","journal-title":"IRREGULAR"},{"key":"ref15","author":"holtgrewe","year":"2009","journal-title":"A scalable coarsening phase for a multi-level partitioning algorithm Diploma thesis"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68111-3_74"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_19"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536237"},{"key":"ref19","author":"pellegrini","year":"0","journal-title":"The Scot Home Page"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.4203\/csets.17.2"},{"key":"ref4","author":"davis","year":"2008","journal-title":"The University of Florida sparse matrix collection"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827598337373"},{"key":"ref3","first-page":"166","article-title":"A partitioning strategy for pdes across multiprocessors","author":"berger","year":"1985","journal-title":"ICPP"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45198-3_2"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","article-title":"Engineering route planning algorithms","volume":"5515","author":"delling","year":"2009","journal-title":"Algorithmics of Large and Complex Networks"},{"key":"ref8","author":"preis","year":"0","journal-title":"PARTY Partition Library"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00393-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref9","first-page":"1092","article-title":"A relaxation method for solving elliptic difference equations","volume":"5","author":"fedorenko","year":"1961","journal-title":"USSR Comput Math and Math Phys"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2006.1639360"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.05.007"},{"key":"ref22","article-title":"Graph partitioning for high performance scientific simulations","author":"schloegel","year":"2000","journal-title":"CRPC Parallel Computing Handbook"},{"key":"ref21","first-page":"259","article-title":"Linear time 1\/2-approximation algorithm for maximum weighted matching in general graphs","volume":"1563","author":"preis","year":"1999","journal-title":"Proc 16th Symp Theoretical Aspects of Computer Science"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOGO.0000042115.44455.f3"},{"key":"ref23","author":"schulz","year":"2009","journal-title":"Scalable parallel refinement of graph partitions Diploma thesis"},{"key":"ref26","author":"walshaw","year":"2008","journal-title":"The Graph Partitioning Archive"},{"key":"ref25","first-page":"57","article-title":"Stress-calculation in frameworks by the method of &#x201C;Systematic relaxation of constraints","author":"southwell","year":"1935","journal-title":"Proc Roy Soc Edinburgh Sect A"}],"event":{"name":"2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)","location":"Atlanta, GA, USA","start":{"date-parts":[[2010,4,19]]},"end":{"date-parts":[[2010,4,23]]}},"container-title":["2010 IEEE International Symposium on Parallel &amp; Distributed Processing (IPDPS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5465899\/5470342\/05470485.pdf?arnumber=5470485","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T08:58:33Z","timestamp":1497862713000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5470485\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2010.5470485","relation":{},"subject":[],"published":{"date-parts":[[2010]]}}}