{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:36:48Z","timestamp":1725795408448},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079585"},{"type":"electronic","value":"9783319079592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_31","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T12:44:25Z","timestamp":1402404265000},"page":"364-375","source":"Crossref","is-referenced-by-count":7,"title":["Tree-Based Coarsening and Partitioning of Complex Networks"],"prefix":"10.1007","author":[{"given":"Roland","family":"Glantz","sequence":"first","affiliation":[]},{"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Meyerhenke, H., Sanders, P., Wagner, D.: Graph Partitioning and Graph Clustering \u2013 10th DIMACS Impl. Challenge. Contemporary Mathematics, vol.\u00a0588. AMS (2013)","DOI":"10.1090\/conm\/588"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"M.A. Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 88\u201394. Springer, Heidelberg (2000)"},{"key":"31_CR3","unstructured":"Bichot, C., Siarry, P. (eds.): Graph Partitioning. Wiley (2011)"},{"key":"31_CR4","unstructured":"Bulu\u00e7, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent Advances in Graph Partitioning. Technical Report ArXiv:1311.3144 (2014)"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"3468","DOI":"10.1137\/090775087","volume":"6","author":"J. Chen","year":"2011","unstructured":"Chen, J., Safro, I.: Algebraic distance on graphs. SIAM J. Comput.\u00a06, 3468\u20133490 (2011)","journal-title":"SIAM J. Comput."},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Chevalier, C., Safro, I.: Comparison of coarsening schemes for multi-level graph partitioning. In: Proc. Learning and Intelligent Optimization (2009)","DOI":"10.1007\/978-3-642-11169-3_14"},{"issue":"3","key":"31_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1080\/00018732.2011.572452","volume":"60","author":"L.F. Costa de","year":"2011","unstructured":"de Costa, L.F., Oliveira Jr., O.N., Travieso, G., Rodrigues, F.A., Boas, P.R.V., Antiqueira, L., Viana, M.P., Correa Rocha, L.E.: Analyzing and modeling real-world phenomena with complex networks: a survey of applications. Advances in Physics\u00a060(3), 329\u2013412 (2011)","journal-title":"Advances in Physics"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Fagginger Auer, B.O., Bisseling, R.H.: Graph coarsening and clustering on the GPU. In: Graph Partitioning and Graph Clustering. AMS and DIMACS (2013)","DOI":"10.1090\/conm\/588\/11706"},{"issue":"2","key":"31_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/B:VISI.0000022288.19776.77","volume":"59","author":"P.F. Felzenszwalb","year":"2004","unstructured":"Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient graph-based image segmentation. Int. J. Comput. Vision\u00a059(2), 167\u2013181 (2004)","journal-title":"Int. J. Comput. Vision"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11780441_5","volume-title":"Combinatorial Pattern Matching","author":"J. Fischer","year":"2006","unstructured":"Fischer, J., Heun, V.: Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 36\u201348. Springer, Heidelberg (2006)"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Glantz, R., Meyerhenke, H., Schulz, C.: Tree-based Coarsening and Partitioning of Complex Networks. Technical Report arXiv:1402.2782 (2014)","DOI":"10.1007\/978-3-319-07959-2_31"},{"issue":"3","key":"31_CR12","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TPAMI.2006.57","volume":"28","author":"L. Grady","year":"2006","unstructured":"Grady, L., Schwartz, E.L.: Isoperimetric graph partitioning for image segmentation. IEEE Trans. Pattern Anal. Mach. Intell.\u00a028(3), 469\u2013475 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"12","key":"31_CR13","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":"31_CR14","doi-asserted-by":"crossref","unstructured":"Holtgrewe, M., Sanders, P., Schulz, C.: Engineering a scalable high quality graph partitioner. In: 24th Int. Parallel and Distributed Processing Symp, IPDPS (2010)","DOI":"10.1109\/IPDPS.2010.5470485"},{"key":"31_CR15","series-title":"Algorithms and Computation in Mathematics","volume-title":"Graphs, Networks and Algorithms","author":"D. Jungnickel","year":"2005","unstructured":"Jungnickel, D.: Graphs, Networks and Algorithms, 2nd edn. Algorithms and Computation in Mathematics, vol.\u00a05. Springer, Berlin (2005)","edition":"2"},{"issue":"3","key":"31_CR16","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1145\/990308.990313","volume":"51","author":"R. Kannan","year":"2004","unstructured":"Kannan, R., Vempala, S., Vetta, A.: On clusterings: Good, bad and spectral. J. of the ACM\u00a051(3), 497\u2013515 (2004)","journal-title":"J. of the ACM"},{"issue":"1","key":"31_CR17","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":"31_CR18","unstructured":"Leskovec, J.: Stanford Network Analysis Package (SNAP)"},{"issue":"10-11","key":"31_CR19","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/j.parco.2009.09.006","volume":"35","author":"H. Meyerhenke","year":"2009","unstructured":"Meyerhenke, H., Monien, B., Schamberger, S.: Graph partitioning and disturbed diffusion. Parallel Computing\u00a035(10-11), 544\u2013569 (2009)","journal-title":"Parallel Computing"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Pritchard, D., Thurimella, R.: Fast computation of small cuts via cycle space sampling. ACM Trans. Algorithms\u00a046, 46:1\u201346:30 (2011)","DOI":"10.1145\/2000807.2000814"},{"key":"31_CR21","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":"31_CR22","unstructured":"Sanders, P., Schulz, C.: KaHIP \u2013 Karlsruhe High Qualtity Partitioning Homepage, \n                    \n                      http:\/\/algo2.iti.kit.edu\/documents\/kahip\/index.html"},{"key":"31_CR23","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":"31_CR24","unstructured":"Schulz, C.: Hiqh Quality Graph Partititioning. PhD thesis, Karlsruhe Institute of Technology (2013)"},{"issue":"2","key":"31_CR25","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. Journal of Global Optimization\u00a029(2), 225\u2013241 (2004)","journal-title":"Journal of Global Optimization"},{"key":"31_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1007\/978-3-642-03767-2_122","volume-title":"Computer Analysis of Images and Patterns","author":"J. Wassenberg","year":"2009","unstructured":"Wassenberg, J., Middelmann, W., Sanders, P.: An efficient parallel algorithm for graph-based image segmentation. In: Jiang, X., Petkov, N. (eds.) CAIP 2009. LNCS, vol.\u00a05702, pp. 1003\u20131010. Springer, Heidelberg (2009)"}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:40:27Z","timestamp":1558906827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}