{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:27:41Z","timestamp":1743049661025,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319388502"},{"type":"electronic","value":"9783319388519"}],"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-38851-9_20","type":"book-chapter","created":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T11:33:54Z","timestamp":1464694434000},"page":"294-309","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Advanced Multilevel Node Separator Algorithms"],"prefix":"10.1007","author":[{"given":"Peter","family":"Sanders","sequence":"first","affiliation":[]},{"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,1]]},"reference":[{"key":"20_CR1","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications (1993)"},{"key":"20_CR2","volume-title":"Encyclopedia of Social Network Analysis and Mining","author":"D Bader","year":"2014","unstructured":"Bader, D., Kappes, A., Meyerhenke, H., Sanders, P., Schulz, C., Wagner, D.: Benchmarking for graph clustering and partitioning. In: Alhajj, R., Rokne, J. (eds.) Encyclopedia of Social Network Analysis and Mining. Springer, New York (2014)"},{"issue":"2","key":"20_CR3","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"SN Bhatt","year":"1984","unstructured":"Bhatt, S.N., Leighton, F.T.: A framework for solving vlsi graph layout problems. J. Comput. Syst. Sci. 28(2), 300\u2013343 (1984)","journal-title":"J. Comput. Syst. Sci."},{"volume-title":"Graph Partitioning","year":"2011","key":"20_CR4","unstructured":"Bichot, C., Siarry, P. (eds.): Graph Partitioning. Wiley, New York (2011)"},{"issue":"4","key":"20_CR5","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.dam.2009.09.010","volume":"158","author":"P Bonsma","year":"2010","unstructured":"Bonsma, P.: Most balanced minimum cuts. Discrete Appl. Math. 158(4), 261\u2013276 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(92)90140-Q","volume":"42","author":"TN Bui","year":"1992","unstructured":"Bui, T.N., Jones, C.: Finding good approximate vertex and edge partitions is NP-hard. Inf. Process. Lett. 42(3), 153\u2013159 (1992)","journal-title":"Inf. Process. Lett."},{"key":"20_CR7","unstructured":"Bulu\u00e7, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent advances in graph partitioning. In: Algorithm Engineering \u2013 Selected Topics, to app., \n                    arXiv:1311.3144\n                    \n                   (2014)"},{"key":"20_CR8","unstructured":"Davis, T.: The University of Florida Sparse Matrix Collection"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Delling, D., Holzer, M., M\u00fcller, K., Schulz, F., Wagner, D.: High-performance multi-level routing. In: The Shortest Path Problem: Ninth DIMACS Implementation Challenge, vol. 74, pp. 73\u201392 (2009)","DOI":"10.1090\/dimacs\/074\/04"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","volume-title":"Algorithmics of Large and Complex Networks","author":"D Delling","year":"2009","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering route planning algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics. LNCS, vol. 5515, pp. 117\u2013139. Springer, Heidelberg (2009)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/978-3-319-07959-2_23","volume-title":"Experimental Algorithms","author":"J Dibbelt","year":"2014","unstructured":"Dibbelt, J., Strasser, B., Wagner, D.: Customizable contraction hierarchies. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 271\u2013282. Springer, Heidelberg (2014)"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0020-0190(02)00393-9","volume":"85","author":"D Drake","year":"2003","unstructured":"Drake, D., Hougardy, S.: A simple approximation algorithm for the weighted matching problem. Inf. Process. Lett. 85, 211\u2013213 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"317","DOI":"10.7155\/jgaa.00130","volume":"10","author":"J Fukuyama","year":"2006","unstructured":"Fukuyama, J.: NP-completeness of the planar separator problems. J. Graph Algorithms Appl. 10(2), 317\u2013328 (2006)","journal-title":"J. Graph Algorithms Appl."},{"key":"20_CR14","volume-title":"Computers and Intractability","author":"MR Garey","year":"2002","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 29. WH Freeman\u00a0 & Co., San Francisco (2002)"},{"issue":"2","key":"20_CR15","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1137\/0710032","volume":"10","author":"A George","year":"1973","unstructured":"George, A.: Nested dissection of a regular finite element mesh. SIAM J. Numer. Anal. 10(2), 345\u2013363 (1973)","journal-title":"SIAM J. Numer. Anal."},{"key":"20_CR16","unstructured":"Hager, W.W., Hungerford, J.T., Safro, I.: A multilevel bilinear programming algorithm for the vertex separator problem. Technical report (2014)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Hamann, M., Strasser, B.: Graph bisection with pareto-optimization. In: Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, pp. 90\u2013102. SIAM (2016)","DOI":"10.1137\/1.9781611974317.8"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Holtgrewe, M., Sanders, P., Schulz, C.: Engineering a scalable high quality graph partitioner. In: Proceedings of the 24th International Parallal and Distributed Processing Symposium, pp. 1\u201312 (2010)","DOI":"10.1109\/IPDPS.2010.5470485"},{"issue":"1","key":"20_CR19","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":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-662-48096-0_36","volume-title":"Euro-Par 2015: Parallel Processing","author":"D LaSalle","year":"2015","unstructured":"LaSalle, D., Karypis, G.: Efficient nested dissection for multicore architectures. In: Tr\u00e4ff, J.L., Hunold, S., Versaci, F. (eds.) Euro-Par 2015. LNCS, vol. 9233, pp. 467\u2013478. Springer, Heidelberg (2015)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E.: Area-efficient graph layouts. In: 21st Symposium on Foundations of Computer Science, pp. 270\u2013281. IEEE (1980)","DOI":"10.1109\/SFCS.1980.13"},{"issue":"2","key":"20_CR22","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"RJ Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36(2), 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"20_CR23","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"RJ Lipton","year":"1980","unstructured":"Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9(3), 615\u2013627 (1980)","journal-title":"SIAM J. Comput."},{"key":"20_CR24","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. 4525, pp. 242\u2013255. Springer, Heidelberg (2007)"},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-15775-2_24","volume-title":"Algorithms \u2013 ESA 2010","author":"V Osipov","year":"2010","unstructured":"Osipov, V., Sanders, P.: n-Level graph partitioning. In: Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol. 6346, pp. 278\u2013289. Springer, Heidelberg (2010)"},{"key":"20_CR26","unstructured":"Pellegrini, F.: Scotch Home Page. \n                    http:\/\/www.labri.fr\/pelegrin\/scotch"},{"key":"20_CR27","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/BFb0120902","volume":"13","author":"JC Picard","year":"1980","unstructured":"Picard, J.C., Queyranne, M.: On the structure of all minimum cuts in a network and applications. Math. Program. Stud. 13, 8\u201316 (1980)","journal-title":"Math. Program. Stud."},{"issue":"3","key":"20_CR28","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. 11(3), 430\u2013452 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"20_CR29","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":"20_CR30","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. 7933, pp. 164\u2013175. Springer, Heidelberg (2013)"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schulz, C.: Advanced Multilevel Node Separator Algorithms. Technical report. \n                    arXiv:1509.01190\n                    \n                   (2016)","DOI":"10.1007\/978-3-319-38851-9_20"},{"key":"20_CR32","volume-title":"CRPC Parallel Computing 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 Parallel Computing Handbook. Morgan Kaufmann, San Francisco (2000)"},{"key":"20_CR33","unstructured":"C. Schulz. High Quality Graph Partititioning. Ph.D. thesis, Karlsruhe Institute of Technology (2013)"},{"key":"20_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-45643-0_4","volume-title":"Algorithm Engineering and Experiments","author":"F Schulz","year":"2002","unstructured":"Schulz, F., Wagner, D., Zaroliagis, C.D.: Using multi-level graphs for timetable information in railway systems. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol. 2409, pp. 43\u201359. Springer, Heidelberg (2002)"},{"issue":"2","key":"20_CR35","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(2), 225\u2013241 (2004)","journal-title":"J. Global Optim."},{"issue":"1","key":"20_CR36","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. Ann. Oper. Res. 131(1), 325\u2013372 (2004)","journal-title":"Ann. Oper. Res."}],"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-319-38851-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:36:13Z","timestamp":1558312573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-38851-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319388502","9783319388519"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38851-9_20","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":"1 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}