{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T09:02:54Z","timestamp":1775638974016,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319079585","type":"print"},{"value":"9783319079592","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_30","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T12:44:25Z","timestamp":1402404265000},"page":"351-363","source":"Crossref","is-referenced-by-count":32,"title":["Partitioning Complex Networks via Size-Constrained Clustering"],"prefix":"10.1007","author":[{"given":"Henning","family":"Meyerhenke","sequence":"first","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Abou-Rjeili, A., Karypis, G.: Multilevel Algorithms for Partitioning Power-Law Graphs. In: Proc. of 20th Int. Parallel and Distributed Processing Symp. (2006)","DOI":"10.1109\/IPDPS.2006.1639360"},{"key":"30_CR2","unstructured":"Bader, D.A., Meyerhenke, H., Sanders, P., Schulz, C., Kappes, A., Wagner, D.: Benchmarking for Graph Clustering and Partitioning. In: Encyclopedia of Social Network Analysis and Mining (to appear)"},{"key":"30_CR3","unstructured":"Bichot, C., Siarry, P. (eds.): Graph Partitioning. Wiley (2011)"},{"issue":"3","key":"30_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(92)90140-Q","volume":"42","author":"T.N. Bui","year":"1992","unstructured":"Bui, T.N., Jones, C.: Finding Good Approximate Vertex and Edge Partitions is NP-Hard. Information Processing Letters\u00a042(3), 153\u2013159 (1992)","journal-title":"Information Processing Letters"},{"key":"30_CR5","unstructured":"Bulu\u00e7, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent Advances in Graph Partitioning. In: Algorithm Engineering \u2013 Selected Topics, ArXiv:1311.3144 (to appear, 2014)"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-11169-3_14","volume-title":"Learning and Intelligent Optimization","author":"C. Chevalier","year":"2009","unstructured":"Chevalier, C., Safro, I.: Comparison of Coarsening Schemes for Multilevel Graph Partitioning. In: St\u00fctzle, T. (ed.) LION 3. LNCS, vol.\u00a05851, pp. 191\u2013205. Springer, Heidelberg (2009)"},{"issue":"3","key":"30_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1080\/00018732.2011.572452","volume":"60","author":"L.F. Costa","year":"2011","unstructured":"Costa, L.F., Oliveira Jr., O.N., Travieso, G., Rodrigues, F.A., Boas, P.R.V., Antiqueira, L., Viana, M.P., Rocha, L.E.C.: Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications. Adv. in Physics\u00a060(3), 329\u2013412 (2011)","journal-title":"Adv. in Physics"},{"issue":"12","key":"30_CR8","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1016\/S0167-8191(00)00043-0","volume":"26","author":"R. Diekmann","year":"2000","unstructured":"Diekmann, R., Preis, R., Schlimbach, F., Walshaw, C.: Shape-optimized Mesh Partitioning and Load Balancing for Parallel Adaptive FEM. Par. Computing\u00a026(12), 1555\u20131581 (2000)","journal-title":"Par. Computing"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some Simplified NP-Complete Problems. In: Proc. of the 6th ACM Symp. on Theory of Computing, STOC 1974, pp. 47\u201363. ACM (1974)","DOI":"10.1145\/800119.803884"},{"issue":"12","key":"30_CR10","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/S0167-8191(00)00048-X","volume":"26","author":"B. Hendrickson","year":"2000","unstructured":"Hendrickson, B., Kolda, T.G.: Graph Partitioning Models for Parallel Computing. Parallel Computing\u00a026(12), 1519\u20131534 (2000)","journal-title":"Parallel Computing"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Holtgrewe, M., Sanders, P., Schulz, C.: Engineering a Scalable High Quality Graph Partitioner. In: Proc. of the 24th Int. Parallal and Distributed Processing Symp., pp. 1\u201312 (2010)","DOI":"10.1109\/IPDPS.2010.5470485"},{"issue":"1","key":"30_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM J. on Scientific Computing\u00a020(1), 359\u2013392 (1998)","journal-title":"SIAM J. on Scientific Computing"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Multilevel k-Way Hypergraph Partitioning. In: Proc. of the 36th ACM\/IEEE Design Automation Conference, pp. 343\u2013348. ACM (1999)","DOI":"10.1145\/309847.309954"},{"key":"30_CR14","unstructured":"University of\u00a0Milano Laboratory\u00a0of Web\u00a0Algorithms. Datasets, \n                    \n                      http:\/\/law.dsi.unimi.it\/datasets.php"},{"key":"30_CR15","unstructured":"Leskovec, J.: Stanford Network Analysis Package (SNAP), \n                    \n                      http:\/\/snap.stanford.edu\/index.html"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Meyerhenke, H., Monien, B., Schamberger, S.: Accelerating Shape Optimizing Load Balancing for Parallel FEM Simulations by Algebraic Multigrid. In: Proc. of 20th Int. Parallel and Distributed Processing Symp. (2006)","DOI":"10.1109\/IPDPS.2006.1639295"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Meyerhenke, H., Sanders, P., Schulz, C.: Partitioning Complex Networks via Size-Constrained Clustering. Technical Report arxiv:1402.3281 (2014)","DOI":"10.1007\/978-3-319-07959-2_30"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Ovelg\u00f6nne, M.: Distributed Community Detection in Web-Scale Networks. In: 2013 Int. Conf. on Advances in Social Networks Analysis and Mining, pp. 66\u201373 (2013)","DOI":"10.1145\/2492517.2492518"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Ovelg\u00f6nne, M., Geyer-Schulz, A.: An Ensemble Learning Strategy for Graph Clustering. In: Graph Partitioning and Graph Clustering. Contemporary Mathematics. AMS and DIMACS, vol.\u00a0(588) (2013)","DOI":"10.1090\/conm\/588\/11701"},{"key":"30_CR20","unstructured":"Pellegrinim, F.: Scotch Home Page, \n                    \n                      http:\/\/wwwlabri.fr\/pelegrin\/scotch\n                    \n                    \n                  ."},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Raghavan, U.N., Albert, R., Kumara, S.: Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks. Physical Review E\u00a076(3) (2007)","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-30850-5_32","volume-title":"Experimental Algorithms","author":"I. Safro","year":"2012","unstructured":"Safro, I., Sanders, P., Schulz, C.: Advanced Coarsening Schemes for Graph Partitioning. In: Klasing, R. (ed.) SEA 2012. LNCS, vol.\u00a07276, pp. 369\u2013380. Springer, Heidelberg (2012)"},{"key":"30_CR23","unstructured":"Sanders, P., Schulz, C.: KaHIP \u2013 Karlsruhe High Qualtity Partitioning Homepage, \n                    \n                      http:\/\/algo2.iti.kit.edu\/documents\/kahip\/index.html"},{"key":"30_CR24","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":"30_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-38527-8_16","volume-title":"Experimental Algorithms","author":"P. Sanders","year":"2013","unstructured":"Sanders, P., Schulz, C.: Think Locally, Act Globally: Highly Balanced Graph Partitioning. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol.\u00a07933, pp. 164\u2013175. Springer, Heidelberg (2013)"},{"key":"30_CR26","unstructured":"Schulz, C.: High Quality Graph Partititioning. PhD thesis, KIT (2013)"},{"key":"30_CR27","doi-asserted-by":"crossref","unstructured":"Staudt, C.L., Meyerhenke, H.: Engineering High-Performance Community Detection Heuristics for Massive Graphs. In: Proc. 42nd Conf. on Parallel Processing (ICPP 2013) (2013)","DOI":"10.1109\/ICPP.2013.27"},{"key":"30_CR28","doi-asserted-by":"crossref","unstructured":"Ugander, J., Backstrom, L.: Balanced Label Propagation for Partitioning Massive Graphs. In: 6\u2019th Int. Conf. on Web Search and Data Mining (WSDM 2013), pp. 507\u2013516. ACM (2013)","DOI":"10.1145\/2433396.2433461"},{"issue":"1","key":"30_CR29","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":"30_CR30","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 J. on Scientific Computing\u00a022(1), 63\u201380 (2000)","journal-title":"SIAM J. on Scientific Computing"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07959-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:47:30Z","timestamp":1558907250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}