{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T22:47:15Z","timestamp":1778539635411,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642385261","type":"print"},{"value":"9783642385278","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_16","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T13:23:02Z","timestamp":1368019382000},"page":"164-175","source":"Crossref","is-referenced-by-count":112,"title":["Think Locally, Act Globally: Highly Balanced Graph Partitioning"],"prefix":"10.1007","author":[{"given":"Peter","family":"Sanders","sequence":"first","affiliation":[]},{"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Bader, D., Meyerhenke, H., Sanders, P., Wagner, D.: 10th DIMACS Implementation Challenge - Graph Partitioning and Graph Clustering"},{"issue":"7","key":"16_CR2","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1016\/j.cor.2010.10.007","volume":"38","author":"U. Benlic","year":"2011","unstructured":"Benlic, U., Hao, J.-K.: An effective multilevel tabu search approach for balanced graph partitioning. Computers & OR\u00a038(7), 1066\u20131075 (2011)","journal-title":"Computers & OR"},{"key":"16_CR3","unstructured":"Bichot, C., Siarry, P. (eds.): Graph Partitioning. Wiley (2011)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/3-540-61680-2_67","volume-title":"Algorithms - ESA \u201996","author":"B.V. Cherkassky","year":"1996","unstructured":"Cherkassky, B.V., Goldberg, A.V.: Negative-cycle detection algorithms. In: D\u00edaz, J. (ed.) ESA 1996. LNCS, vol.\u00a01136, pp. 349\u2013363. Springer, Heidelberg (1996)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-642-33090-2_36","volume-title":"Algorithms \u2013 ESA 2012","author":"D. Delling","year":"2012","unstructured":"Delling, D., Werneck, R.F.: Better bounds for graph bisection. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 407\u2013418. Springer, Heidelberg (2012)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A Linear-Time Heuristic for Improving Network Partitions. In: 19th Conference on Design Automation, pp. 175\u2013181 (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Galinier, P., Boujbel, Z., Coutinho Fernandes, M.: An efficient memetic algorithm for the graph partitioning problem. Annals of Operations Research, 1\u201322 (2011)","DOI":"10.1007\/s10479-011-0983-3"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Holtgrewe, M., Sanders, P., Schulz, C.: Engineering a Scalable High Quality Graph Partitioner. In: 24th IEEE IPDPS, pp. 1\u201312 (2010)","DOI":"10.1109\/IPDPS.2010.5470485"},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1137\/S0036144598334138","volume":"41","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Kumar, V.: Parallel multilevel k-way partitioning scheme for irregular graphs. SIAM Review\u00a041(2), 278\u2013300 (1999)","journal-title":"SIAM Review"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-15775-2_24","volume-title":"Algorithms \u2013 ESA 2010","author":"V. Osipov","year":"2010","unstructured":"Osipov, V., Sanders, P.: n-level graph partitioning. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol.\u00a06346, pp. 278\u2013289. Springer, Heidelberg (2010)"},{"key":"16_CR11","unstructured":"Pellegrini, F.: \n                    \n                      http:\/\/www.labri.fr\/perso\/pelegrin\/scotch\/"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-642-23719-5_40","volume-title":"Algorithms \u2013 ESA 2011","author":"P. Sanders","year":"2011","unstructured":"Sanders, P., Schulz, C.: Engineering multilevel graph partitioning algorithms. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 469\u2013480. Springer, Heidelberg (2011)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schulz, C.: Distributed evolutionary graph partitioning. In: ALENEX, pp. 16\u201329. SIAM\/Omnipress (2012)","DOI":"10.1137\/1.9781611972924.2"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schulz, C.: Think Locally, Act Globally: Perfectly Balanced Graph Partitioning. Technical Report. arXiv:1210.0477 (2012)","DOI":"10.1007\/978-3-642-38527-8_16"},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/B:JOGO.0000042115.44455.f3","volume":"29","author":"A.J. Soper","year":"2004","unstructured":"Soper, A.J., Walshaw, C., Cross, M.: A combined evolutionary search and multilevel optimisation approach to graph-partitioning. J. of Global Optimization\u00a029(2), 225\u2013241 (2004)","journal-title":"J. of Global Optimization"},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1137\/S1064827598337373","volume":"22","author":"C. Walshaw","year":"2000","unstructured":"Walshaw, C., Cross, M.: Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm. SIAM Journal on Scientific Computing\u00a022(1), 63\u201380 (2000)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Walshaw, C., Cross, M.: JOSTLE: Parallel Multilevel Graph-Partitioning Software \u2013 An Overview. In: Mesh Partitioning Techniques and Domain Decomposition Techniques, pp. 27\u201358. Civil-Comp Ltd. (2007)","DOI":"10.4203\/csets.17.2"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:38:19Z","timestamp":1557704299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}