{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T10:21:17Z","timestamp":1773224477952,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642237188","type":"print"},{"value":"9783642237195","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_40","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"469-480","source":"Crossref","is-referenced-by-count":95,"title":["Engineering Multilevel Graph Partitioning Algorithms"],"prefix":"10.1007","author":[{"given":"Peter","family":"Sanders","sequence":"first","affiliation":[]},{"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","first-page":"651","volume-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"R. Andersen","year":"2008","unstructured":"Andersen, R., Lang, K.J.: An algorithm for improving graph partitions. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 651\u2013660. SIAM, Philadelphia (2008)"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Briggs, W.L., McCormick, S.F.: A multigrid tutorial. Soc. for Ind. Mathe (2000)","DOI":"10.1137\/1.9780898719505"},{"key":"40_CR3","unstructured":"Fjallstrom, P.O.: Algorithms for graph partitioning: A survey. Linkoping Electronic Articles in Computer and Information Science 3(10) (1998)"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Holtgrewe, M., Sanders, P., Schulz, C.: Engineering a Scalable High Quality Graph Partitioner. In: 24th IEEE International Parallal and Distributed Processing Symposium (2010)","DOI":"10.1109\/IPDPS.2010.5470485"},{"key":"40_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-25960-2_25","volume-title":"Integer Programming and Combinatorial Optimization","author":"K. Lang","year":"2004","unstructured":"Lang, K., Rao, S.: A flow-based method for improving the expansion or conductance of graph cuts. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol.\u00a03064, pp. 325\u2013337. Springer, Heidelberg (2004)"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Meyerhenke, H., Monien, B., Sauerwald, T.: A new diffusion-based multilevel algorithm for computing graph partitions of very high quality. In: IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, pp. 1\u201313 (2008)","DOI":"10.1109\/IPDPS.2008.4536237"},{"key":"40_CR7","unstructured":"Osipov, V., Sanders, P.: n-Level Graph Partitioning. In: 18th European Symposium on Algorithms (2010); see also arxiv preprint arXiv:1004.4024"},{"key":"40_CR8","unstructured":"Pellegrini, F.: Scotch home page, http:\/\/www.labri.fr\/pelegrin\/scotch"},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/BFb0120902","volume":"13","author":"J.C. Picard","year":"1980","unstructured":"Picard, J.C., Queyranne, M.: On the structure of all minimum cuts in a network and applications. Mathematical Programming Studies\u00a013, 8\u201316 (1980)","journal-title":"Mathematical Programming Studies"},{"key":"40_CR10","unstructured":"Sanders, P., Schulz, C.: Engineering Multilevel Graph Partitioning Algorithms. Technical report, Karlsruhe Institute of Technology (2010); see ArXiv preprint arXiv:1012.0006v3"},{"key":"40_CR11","volume-title":"CRPC Par. Comp. Handbook","author":"K. Schloegel","year":"2000","unstructured":"Schloegel, K., Karypis, G., Kumar, V.: Graph partitioning for high performance scientific simulations. In: Dongarra, J., et al. (eds.) CRPC Par. Comp. Handbook. Morgan Kaufmann, San Francisco (2000)"},{"key":"40_CR12","unstructured":"Southwell, R.V.: Stress-calculation in frameworks by the method of \u201cSystematic relaxation of constraints\u201d. Proc. Roy. Soc. Edinburgh Sect. A, 57\u201391 (1935)"},{"issue":"1","key":"40_CR13","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1023\/B:ANOR.0000039525.80601.15","volume":"131","author":"C. Walshaw","year":"2004","unstructured":"Walshaw, C.: Multilevel refinement for combinatorial optimisation problems. Annals of Operations Research\u00a0131(1), 325\u2013372 (2004)","journal-title":"Annals of Operations Research"},{"issue":"1","key":"40_CR14","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":"40_CR15","doi-asserted-by":"crossref","unstructured":"Walshaw, C., Cross, M.: JOSTLE: Parallel Multilevel Graph-Partitioning Software \u2013 An Overview. In: Magoules, F. (ed.) Mesh Partitioning Techniques and Domain Decomposition Techniques, pp. 27\u201358. Civil-Comp Ltd (2007) (invited chapter)","DOI":"10.4203\/csets.17.2"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T16:08:44Z","timestamp":1560528524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}