{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:14:27Z","timestamp":1742994867072,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319321486"},{"type":"electronic","value":"9783319321493"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32149-3_21","type":"book-chapter","created":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T02:24:42Z","timestamp":1459477482000},"page":"218-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Diffusion Process for Graph Partitioning: Its Solutions and Their Improvement"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Jocksch","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,2]]},"reference":[{"key":"21_CR1","unstructured":"http:\/\/www.corc.ieor.columbia.edu\/meetings\/ipcox\/talks\/kevin\/export-ipco-talk\/gparchive.html"},{"key":"21_CR2","unstructured":"https:\/\/cfwebprod.sandia.gov\/cfdocs\/CompResearch\/templates\/insert\/software.cfm"},{"issue":"4","key":"21_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/cpe.4330020403","volume":"2","author":"JE Boillat","year":"1990","unstructured":"Boillat, J.E.: Load balancing and Poisson equation in a graph. Concur. Pract. Exper. 2(4), 289\u2013313 (1990)","journal-title":"Concur. Pract. Exper."},{"key":"21_CR4","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. Parallel Comput. 26, 1555\u20131581 (2000)","journal-title":"Parallel Comput."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: 19th Design Automation Conference, pp. 175\u2013181. IEEE (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0916028","volume":"16","author":"B Hendrickson","year":"1995","unstructured":"Hendrickson, B., Leland, R.: An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J. Sci. Comput. 16(2), 452\u2013469 (1995). SANDIA REPORT SAND92-1460 \n$$\\cdot $$\n UC-405 September 1992","journal-title":"SIAM J. Sci. Comput."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: Proceedings of Supercomputing 1995, vol. 1, pp. 626\u2013657. ACM\/IEEE (1995)","DOI":"10.1145\/224170.224228"},{"issue":"1","key":"21_CR8","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. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/jpdc.1997.1403","volume":"48","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A parallel algorithm for multilevel graph partitioning and sparse matrix ordering. J. Parallel Distrib. Comput. 48, 71\u201395 (1998)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"21_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"issue":"4598","key":"21_CR11","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"5","key":"21_CR12","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1109\/TC.1984.1676460","volume":"c\u201333","author":"B Krishnamurthy","year":"1984","unstructured":"Krishnamurthy, B.: An improved min-cut algorithm for partitioning VLSI networks. IEEE Trans. Comput. c\u201333(5), 438\u2013446 (1984)","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"21_CR13","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1109\/TPAMI.2006.184","volume":"28","author":"S Lafon","year":"2006","unstructured":"Lafon, S., Lee, A.B.: Diffusion maps and coarse-graining: a unified framework for dimensionality reduction, graph partitioning, and data set parametrization. IEEE Trans. Pattern Anal. 28(9), 1393\u20131403 (2006)","journal-title":"IEEE Trans. Pattern Anal."},{"key":"21_CR14","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: Parallel and Distributed Processing, IPDPS, pp. 1\u201313. IEEE, Miami (2008)","DOI":"10.1109\/IPDPS.2008.4536237"},{"key":"21_CR15","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 Comput. 35, 544\u2013569 (2009)","journal-title":"Parallel Comput."},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-540-74466-5_22","volume-title":"Euro-Par 2007 Parallel Processing","author":"F Pellegrini","year":"2007","unstructured":"Pellegrini, F.: A parallelisable multi-level banded diffusion scheme for computing balanced partitions with smooth boundaries. In: Kermarrec, A.-M., Boug\u00e9, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol. 4641, pp. 195\u2013204. Springer, Heidelberg (2007)"},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/12.8730","volume":"38","author":"LA Sanchis","year":"1989","unstructured":"Sanchis, L.A.: Multiple-way network partitioning. IEEE Trans. Comput. 38(1), 62\u201381 (1989)","journal-title":"IEEE Trans. Comput."},{"key":"21_CR18","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. 6942, pp. 469\u2013480. Springer, Heidelberg (2011)"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/B:JOGO.0000042115.44455.f3","volume":"29","author":"AJ Soper","year":"2004","unstructured":"Soper, A.J., Walshaw, C., Cross, M.: A combined evolutionary search and multilevel optimisation approach to graph-partitioning. J. Global Optim. 29, 225\u2013241 (2004)","journal-title":"J. Global Optim."},{"key":"21_CR20","volume-title":"Load Balancing in Parallel Computers: Theory and Practice","author":"C Xu","year":"1997","unstructured":"Xu, C., Lau, F.C.M.: Load Balancing in Parallel Computers: Theory and Practice. Kluwer, Boston (1997)"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32149-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,15]],"date-time":"2020-12-15T01:09:35Z","timestamp":1607994575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32149-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319321486","9783319321493"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32149-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"2 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}