{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:44:43Z","timestamp":1725464683007},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308499"},{"type":"electronic","value":"9783642308505"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30850-5_32","type":"book-chapter","created":{"date-parts":[[2012,5,27]],"date-time":"2012-05-27T21:44:33Z","timestamp":1338155073000},"page":"369-380","source":"Crossref","is-referenced-by-count":15,"title":["Advanced Coarsening Schemes for Graph Partitioning"],"prefix":"10.1007","author":[{"given":"Ilya","family":"Safro","sequence":"first","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Safro, I., Sanders, P., Schulz, C.: Advanced coarsening schemes for graph partitioning. Technical Report ANL\/MCS-P2016-0112, Argonne National Laboratory (2012)","key":"32_CR1","DOI":"10.1007\/978-3-642-30850-5_32"},{"issue":"3","key":"32_CR2","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. Inf. Process. Lett.\u00a042(3), 153\u2013159 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"32_CR3","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"Pothen, A., Simon, H.D., Liou, K.P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl.\u00a011(3), 430\u2013452 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"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)","key":"32_CR4","DOI":"10.1109\/DAC.1982.1585498"},{"unstructured":"Sanders, P., Schulz, C.: Distributed Evolutionary Graph Partitioning. In: 12th Workshop on Algorithm Engineering and Experimentation (2011)","key":"32_CR5"},{"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 (2000)","key":"32_CR6"},{"unstructured":"Pellegrini, F.: Scotch home page, \n                    \n                      http:\/\/www.labri.fr\/pelegrin\/scotch","key":"32_CR7"},{"issue":"1","key":"32_CR8","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1137\/100791142","volume":"9","author":"D. Ron","year":"2011","unstructured":"Ron, D., Safro, I., Brandt, A.: Relaxation-based coarsening and multiscale graph organization. Multiscale Modeling & Simulation\u00a09(1), 407\u2013423 (2011)","journal-title":"Multiscale Modeling & Simulation"},{"key":"32_CR9","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":"32_CR10","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":"1","key":"32_CR11","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"},{"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)","key":"32_CR12","DOI":"10.1109\/IPDPS.2010.5470485"},{"issue":"6","key":"32_CR13","doi-asserted-by":"publisher","first-page":"3468","DOI":"10.1137\/090775087","volume":"33","author":"J. Chen","year":"2011","unstructured":"Chen, J., Safro, I.: Algebraic distance on graphs. SIAM Journal on Scientific Computing\u00a033(6), 3468\u20133490 (2011)","journal-title":"SIAM Journal on Scientific Computing"},{"unstructured":"Brandt, A.: Multiscale scientific computation: Review 2001. In: Barth, T., Haimes, R., Chan, T. (eds.) Proceeding of the Yosemite Educational Symposium on Multiscale and Multiresolution Methods. Springer (October 2000)","key":"32_CR14"},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-540-72845-0_19","volume-title":"Experimental Algorithms","author":"J. Maue","year":"2007","unstructured":"Maue, J., Sanders, P.: Engineering Algorithms for Approximate Weighted Matching. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 242\u2013255. Springer, Heidelberg (2007)"},{"unstructured":"Safro, I., Sanders, P., Schulz, C.: Benchmark with Potentially Hard Graphs for Partitioning Problem, \n                    \n                      http:\/\/www.mcs.anl.gov\/~safro\/hardpart.html","key":"32_CR16"},{"unstructured":"Bader, D., Meyerhenke, H., Sanders, P., Wagner, D.: 10th DIMACS Implementation Challenge - Graph Partitioning and Graph Clustering, \n                    \n                      http:\/\/www.cc.gatech.edu\/dimacs10\/","key":"32_CR17"},{"unstructured":"Lescovec, J.: Stanford Network Analysis Package (SNAP), \n                    \n                      http:\/\/snap.stanford.edu\/index.html","key":"32_CR18"},{"doi-asserted-by":"crossref","unstructured":"Safro, I., Ron, D., Brandt, A.: Multilevel algorithms for linear ordering problems. Journal of Experimental Algorithmics 13, 1.4\u20131.20 (2008)","key":"32_CR19","DOI":"10.1145\/1412228.1412232"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30850-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:02:32Z","timestamp":1558299752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30850-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308499","9783642308505"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30850-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}