{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T20:05:55Z","timestamp":1777406755522,"version":"3.51.4"},"reference-count":194,"publisher":"Association for Computing Machinery (ACM)","issue":"12","license":[{"start":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T00:00:00Z","timestamp":1677715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DFG","award":["SCHU 2567\/1-2, WA654\/19-2, SA933\/10-2, SA933\/11-1"],"award-info":[{"award-number":["SCHU 2567\/1-2, WA654\/19-2, SA933\/10-2, SA933\/11-1"]}]},{"name":"NSF","award":["CCF-1919021"],"award-info":[{"award-number":["CCF-1919021"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2023,12,31]]},"abstract":"<jats:p>\n            In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms. We survey trends of the past decade in practical algorithms for balanced (hyper)graph partitioning together with future research directions. Our work serves as an update to a previous survey on the topic\u00a0[\n            <jats:xref ref-type=\"bibr\">29<\/jats:xref>\n            ]. In particular, the survey extends the previous survey by also covering hypergraph partitioning and has an additional focus on parallel algorithms.\n          <\/jats:p>","DOI":"10.1145\/3571808","type":"journal-article","created":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T11:51:53Z","timestamp":1669204313000},"page":"1-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":63,"title":["More Recent Advances in (Hyper)Graph Partitioning"],"prefix":"10.1145","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5625-3758","authenticated-orcid":false,"given":"\u00dcmit","family":"\u00c7ataly\u00fcrek","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9335-4665","authenticated-orcid":false,"given":"Karen","family":"Devine","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, ret., Albuquerque, NM, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7100-236X","authenticated-orcid":false,"given":"Marcelo","family":"Faraj","sequence":"additional","affiliation":[{"name":"Heidelberg University, Baden-W\u00fcrttemberg, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1895-5828","authenticated-orcid":false,"given":"Lars","family":"Gottesb\u00fcren","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Baden-W\u00fcrttemberg, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5399-0496","authenticated-orcid":false,"given":"Tobias","family":"Heuer","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Baden-W\u00fcrttemberg, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7769-726X","authenticated-orcid":false,"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3330-9349","authenticated-orcid":false,"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Baden-W\u00fcrttemberg, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1550-882X","authenticated-orcid":false,"given":"Sebastian","family":"Schlag","sequence":"additional","affiliation":[{"name":"Apple Inc., Cupertino, CA, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2823-3506","authenticated-orcid":false,"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[{"name":"Heidelberg University, Baden-W\u00fcrttemberg, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1997-1304","authenticated-orcid":false,"given":"Daniel","family":"Seemaier","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Baden-W\u00fcrttemberg, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9141-7076","authenticated-orcid":false,"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Baden-W\u00fcrttemberg, Germany"}]}],"member":"320","published-online":{"date-parts":[[2023,3,2]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2021.102769"},{"key":"e_1_3_2_3_2","first-page":"440","volume-title":"Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW\u201920)","author":"Acer Seher","year":"2020","unstructured":"Seher Acer, Erik G. Boman, and Sivasankaran Rajamanickam. 2020. SPHYNX: Spectral partitioning for hybrid and axelerator-enabled systems. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW\u201920). 440\u2013449. 10.1109\/IPDPSW50202.2020.00082"},{"key":"e_1_3_2_4_2","first-page":"28","volume-title":"Proceedings of the 19th Workshop on Algorithm Engineering and Experiments (ALENEX\u201917)","author":"Akhremtsev Yaroslav","year":"2017","unstructured":"Yaroslav Akhremtsev, Tobias Heuer, Peter Sanders, and Sebastian Schlag. 2017. Engineering a direct k-way hypergraph partitioning algorithm. In Proceedings of the 19th Workshop on Algorithm Engineering and Experiments (ALENEX\u201917). SIAM, 28\u201342. 10.1137\/1.9781611974768.3"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3001645"},{"key":"e_1_3_2_6_2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/274535.274546","volume-title":"Proceedings of the International Symposium on Physical Design (ISPD\u201998)","author":"Alpert Charles J.","year":"1998","unstructured":"Charles J. Alpert. 1998. The ISPD98 circuit benchmark suite. In Proceedings of the International Symposium on Physical Design (ISPD\u201998), Majid Sarrafzadeh (Ed.). ACM, 80\u201385. 10.1145\/274535.274546"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/43.712098"},{"issue":"1","key":"e_1_3_2_8_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","article-title":"Recent directions in netlist partitioning: A survey","volume":"19","author":"Alpert C. J.","year":"1995","unstructured":"C. J. Alpert and A. B. Kahng. 1995. Recent directions in netlist partitioning: A survey. Integr. VLSI J. 19, 1-2 (1995), 1\u201381.","journal-title":"Integr. VLSI J."},{"key":"e_1_3_2_9_2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1109\/DAC.1995.250089","volume-title":"Proceedings of the 32nd Conference on Design Automation","author":"Alpert Charles J.","year":"1995","unstructured":"Charles J. Alpert and So-Zen Yao. 1995. Spectral partitioning: The more eigenvectors, the better. In Proceedings of the 32nd Conference on Design Automation. ACM Press, 195\u2013200. 10.1145\/217474.217529"},{"issue":"9","key":"e_1_3_2_10_2","doi-asserted-by":"crossref","first-page":"2606","DOI":"10.1007\/s00453-020-00701-x","article-title":"The complexity of tree partitioning","volume":"82","author":"An Zhao","year":"2020","unstructured":"Zhao An, Qilong Feng, Iyad Kanj, and Ge Xia. 2020. The complexity of tree partitioning. Algorithmica 82, 9 (2020), 2606\u20132643.","journal-title":"Algorithmica"},{"key":"e_1_3_2_11_2","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/3205455.3205475","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u201918)","author":"Andre Robin","year":"2018","unstructured":"Robin Andre, Sebastian Schlag, and Christian Schulz. 2018. Memetic multilevel hypergraph partitioning. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u201918). ACM, 347\u2013354. 10.1145\/3205455.3205475"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1350-7"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.3390\/a12070127"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.14778\/3311880.3311887"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3041670"},{"key":"e_1_3_2_16_2","volume-title":"GPU Acceleration of Graph Matching, Clustering, and Partitioning","author":"Auer B. O. Fagginger","year":"2013","unstructured":"B. O. Fagginger Auer. 2013. GPU Acceleration of Graph Matching, Clustering, and Partitioning. Ph.D. Dissertation. Utrecht University, Netherlands. Retrieved from http:\/\/dspace.library.uu.nl\/handle\/1874\/278892."},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.3390\/a12080162"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.09.006"},{"key":"e_1_3_2_19_2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithms in Theory and Practice\u2014Evolution Strategies, Evolutionary Programming, Genetic Algorithms","author":"B\u00e4ck Thomas","year":"1996","unstructured":"Thomas B\u00e4ck. 1996. Evolutionary Algorithms in Theory and Practice\u2014Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press."},{"key":"e_1_3_2_20_2","series-title":"Texts in Computational Science and Engineering","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-31046-1","volume-title":"Space-Filling Curves\u2014An Introduction with Applications in Scientific Computing","author":"Bader Michael","year":"2013","unstructured":"Michael Bader. 2013. Space-Filling Curves\u2014An Introduction with Applications in Scientific Computing. Texts in Computational Science and Engineering, Vol. 9. Springer. 10.1007\/978-3-642-31046-1"},{"key":"e_1_3_2_21_2","first-page":"711","volume-title":"Proceedings of the 6th SIAM Conference on Parallel Processing for Scientific Computing","author":"Barnard S. T.","year":"1993","unstructured":"S. T. Barnard and H. D. Simon. 1993. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. In Proceedings of the 6th SIAM Conference on Parallel Processing for Scientific Computing. 711\u2013718."},{"key":"e_1_3_2_22_2","first-page":"121","volume-title":"Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI\u201910)","author":"Benlic Una","year":"2010","unstructured":"Una Benlic and Jin-Kao Hao. 2010. An effective multilevel memetic algorithm for balanced graph partitioning. In Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI\u201910). IEEE Computer Society, 121\u2013128. 10.1109\/ICTAI.2010.25"},{"issue":"5","key":"e_1_3_2_23_2","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1109\/TC.1987.1676942","article-title":"A partitioning strategy for nonuniform problems on multiprocessors","volume":"100","author":"Berger M. J.","year":"1987","unstructured":"M. J. Berger and S. H. Bokhari. 1987. A partitioning strategy for nonuniform problems on multiprocessors. IEEE Trans. Comput. 100, 5 (1987), 570\u2013580.","journal-title":"IEEE Trans. Comput."},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1002\/9781118601181"},{"key":"e_1_3_2_25_2","first-page":"47","article-title":"Communication balancing in parallel sparse matrix-vector multiplication.","volume":"21","author":"Bisseling Rob H.","year":"2005","unstructured":"Rob H. Bisseling and Wouter Meesen. 2005. Communication balancing in parallel sparse matrix-vector multiplication.Electr. Trans. Numer. Anal. 21 (2005), 47\u201365. http:\/\/eudml.org\/doc\/128024.","journal-title":"Electr. Trans. Numer. Anal."},{"key":"e_1_3_2_26_2","volume-title":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP\u201912)","author":"Blelloch Guy E.","year":"2012","unstructured":"Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, and Julian Shun. 2012. Internally deterministic parallel algorithms can be fast. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP\u201912). 10.1145\/2145816.2145840"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/p10008"},{"key":"e_1_3_2_28_2","first-page":"280","volume-title":"Proceedings of the 28th Symposium on Foundations of Computer Science","author":"Boppana R. B.","year":"1987","unstructured":"R. B. Boppana. 1987. Eigenvalues and graph bisection: An average-case analysis (extended abstract). In Proceedings of the 28th Symposium on Foundations of Computer Science. 280\u2013285."},{"key":"e_1_3_2_29_2","doi-asserted-by":"crossref","first-page":"1456","DOI":"10.1145\/2623330.2623660","volume-title":"Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201914)","author":"Bourse Florian","year":"2014","unstructured":"Florian Bourse, Marc Lelarge, and Milan Vojnovic. 2014. Balanced graph edge partition. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201914). ACM, 1456\u20131465. 10.1145\/2623330.2623660"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"e_1_3_2_31_2","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1145\/368434.368864","volume-title":"Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC\u201900)","author":"Caldwell Andrew E.","year":"2000","unstructured":"Andrew E. Caldwell, Andrew B. Kahng, and Igor L. Markov. 2000. Improved algorithms for hypergraph bipartitioning. In Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC\u201900). ACM, 661\u2013666. 10.1145\/368434.368864"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/43.892854"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/71.780863"},{"key":"e_1_3_2_34_2","unstructured":"\u00dc. V. \u00c7ataly\u00fcrek and C. Aykanat. 2011. PaToH: Partitioning Tool for Hypergraphs. Retrieved from https:\/\/www.cc.gatech.edu\/umit\/PaToH\/manual.pdf."},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1137\/080737770"},{"issue":"8","key":"e_1_3_2_36_2","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/j.jpdc.2009.04.011","article-title":"A repartitioning hypergraph model for dynamic load balancing","volume":"69","author":"Catalyurek Umit V.","year":"2009","unstructured":"Umit V. Catalyurek, Erik G. Boman, Karen D. Devine, Doruk Bozda\u011f, Robert T. Heaphy, and Lee Ann Riesen. 2009. A repartitioning hypergraph model for dynamic load balancing. J. Parallel Distrib. Comput. 69, 8 (2009), 711\u2013724.","journal-title":"J. Parallel Distrib. Comput."},{"key":"e_1_3_2_37_2","first-page":"848","volume-title":"Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201912)","author":"\u00c7ataly\u00fcrek \u00dcmit V.","year":"2012","unstructured":"\u00dcmit V. \u00c7ataly\u00fcrek, Mehmet Deveci, Kamer Kaya, and Bora U\u00e7ar. 2012. Multithreaded clustering for multi-level hypergraph partitioning. In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201912). IEEE Computer Society, 848\u2013859. 10.1109\/IPDPS.2012.81"},{"key":"e_1_3_2_38_2","doi-asserted-by":"crossref","unstructured":"\u00dcmit V. \u00c7ataly\u00fcrek Karen D. Devine Marcelo Fonseca Faraj Lars Gottesb\u00fcren Tobias Heuer Henning Meyerhenke Peter Sanders Sebastian Schlag Christian Schulz Daniel Seemaier and Dorothea Wagner. 2022. More recent advances in (hyper)graph partitioning. Retrieved from https:\/\/arXiv:2205.13202.","DOI":"10.1145\/3571808"},{"key":"e_1_3_2_39_2","volume-title":"Proceedings of the ACM\/IEEE Conference on Supercomputing (SC\u201901)","author":"\u00c7ataly\u00fcrek \u00dcmit V.","year":"2001","unstructured":"\u00dcmit V. \u00c7ataly\u00fcrek and Cevdet Aykanat. 2001. A hypergraph-partitioning approach for coarse-grain decomposition. In Proceedings of the ACM\/IEEE Conference on Supercomputing (SC\u201901). 10.1109\/SC.2001.10035"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1137\/090775087"},{"issue":"6","key":"e_1_3_2_41_2","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/j.parco.2007.12.001","article-title":"PT-scotch: A tool for efficient parallel graph ordering","volume":"34","author":"Chevalier C.","year":"2008","unstructured":"C. Chevalier and F. Pellegrini. 2008. PT-scotch: A tool for efficient parallel graph ordering. Parallel Comput. 34, 6 (2008), 318\u2013331.","journal-title":"Parallel Comput."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920853"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3337792"},{"key":"e_1_3_2_44_2","first-page":"376","volume-title":"Proceedings of the 10th International Symposium on Experimental Algorithms (LCNS)","volume":"6630","author":"Delling D.","year":"2011","unstructured":"D. Delling, A. V. Goldberg, T. Pajor, and R. F. Werneck. 2011. Customizable route planning. In Proceedings of the 10th International Symposium on Experimental Algorithms (LCNS), Vol. 6630. Springer, 376\u2013387."},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.12.002"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2412545"},{"key":"e_1_3_2_47_2","first-page":"124","volume-title":"Proceedings of the 20th International Conference on Parallel and Distributed Processing (IPDPS\u201906)","author":"Devine K. D.","year":"2006","unstructured":"K. D. Devine, E. G. Boman, R. T. Heaphy, R. H. Bisseling, and \u00dc. V. Cataly\u00fcrek. 2006. Parallel hypergraph partitioning for scientific computing. In Proceedings of the 20th International Conference on Parallel and Distributed Processing (IPDPS\u201906). IEEE, 124\u2013124."},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.3390\/a12090187"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100263"},{"key":"e_1_3_2_50_2","first-page":"65","article-title":"Logic partitioning","author":"Donath W. E.","year":"1988","unstructured":"W. E. Donath. 1988. Logic partitioning. Phys. Design Autom. VLSI Syst. (1988), 65\u201386.","journal-title":"Phys. Design Autom. VLSI Syst."},{"issue":"3","key":"e_1_3_2_51_2","first-page":"938","article-title":"Algorithms for partitioning of graphs and computer logic based on eigenvectors of connection matrices","volume":"15","author":"Donath W. E.","year":"1972","unstructured":"W. E. Donath and A. J. Hoffman. 1972. Algorithms for partitioning of graphs and computer logic based on eigenvectors of connection matrices. IBM Tech. Disclosure Bull. 15, 3 (1972), 938\u2013944.","journal-title":"IBM Tech. Disclosure Bull."},{"issue":"5","key":"e_1_3_2_52_2","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1147\/rd.175.0420","article-title":"Lower bounds for the partitioning of graphs","volume":"17","author":"Donath W. E.","year":"1973","unstructured":"W. E. Donath and A. J. Hoffman. 1973. Lower bounds for the partitioning of graphs. IBM J. Res. Dev. 17, 5 (1973), 420\u2013425.","journal-title":"IBM J. Res. Dev."},{"key":"e_1_3_2_53_2","first-page":"350","volume-title":"Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design (ICCAD\u201997)","author":"Dutt S.","year":"1997","unstructured":"S. Dutt and H. Theny. 1997. Partitioning around roadblocks: Tackling constraints with intermediate relaxations. In Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design (ICCAD\u201997). IEEE Computer Society\/ACM, 350\u2013355. 10.1109\/ICCAD.1997.643546"},{"key":"e_1_3_2_54_2","volume-title":"Graph Partitioning and Graph Clustering","author":"Auer B. O. Fagginger","year":"2012","unstructured":"B. O. Fagginger Auer and Rob H. Bisseling. 2012. Graph coarsening and clustering on the GPU. In Graph Partitioning and Graph Clustering."},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389142"},{"key":"e_1_3_2_56_2","first-page":"175","volume-title":"Proceedings of the 19th Conference on Design Automation","author":"Fiduccia C. M.","year":"1982","unstructured":"C. M. Fiduccia and R. M. Mattheyses. 1982. A linear-time heuristic for improving network partitions. In Proceedings of the 19th Conference on Design Automation. 175\u2013181."},{"issue":"4","key":"e_1_3_2_57_2","doi-asserted-by":"crossref","first-page":"619","DOI":"10.21136\/CMJ.1975.101357","article-title":"A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory","volume":"25","author":"Fiedler M.","year":"1975","unstructured":"M. Fiedler. 1975. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czech. Math. J. 25, 4 (1975), 619\u2013633.","journal-title":"Czech. Math. J."},{"key":"e_1_3_2_58_2","first-page":"818","volume-title":"Proceedings of the Euro-Par Parallel Processing (LNCS)","volume":"7484","author":"Fietz J.","year":"2012","unstructured":"J. Fietz, M. Krause, C. Schulz, P. Sanders, and V. Heuveline. 2012. Optimized hybrid parallel lattice Boltzmann fluid flow simulations on complex geometries. In Proceedings of the Euro-Par Parallel Processing (LNCS), Vol. 7484. Springer, 818\u2013829."},{"key":"e_1_3_2_59_2","first-page":"818","volume-title":"Proceedings of the 18th International Conference on Parallel Processing (Euro-Par\u201912) (Lecture Notes in Computer Science)","volume":"7484","author":"Fietz Jonas","year":"2012","unstructured":"Jonas Fietz, Mathias J. Krause, Christian Schulz, Peter Sanders, and Vincent Heuveline. 2012. Optimized hybrid parallel lattice boltzmann fluid flow simulations on complex geometries. In Proceedings of the 18th International Conference on Parallel Processing (Euro-Par\u201912) (Lecture Notes in Computer Science), Vol. 7484. Springer, 818\u2013829. 10.1007\/978-3-642-32820-6_81"},{"key":"e_1_3_2_60_2","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/978-1-4612-4380-9_6","volume-title":"Breakthroughs in Statistics","author":"Fisher Ronald Aylmer","year":"1992","unstructured":"Ronald Aylmer Fisher. 1992. Statistical methods for research workers. In Breakthroughs in Statistics. Springer, 66\u201370."},{"issue":"1","key":"e_1_3_2_61_2","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1214\/aoms\/1177731944","article-title":"A comparison of alternative tests of significance for the problem of m rankings","volume":"11","author":"Friedman M.","year":"1940","unstructured":"M. Friedman. 1940. A comparison of alternative tests of significance for the problem of m rankings. Ann. Math. Stat. 11, 1 (1940), 86\u201392.","journal-title":"Ann. Math. Stat."},{"key":"e_1_3_2_62_2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Vol. 174. W.H. Freeman, San Francisco."},{"key":"e_1_3_2_63_2","first-page":"47","volume-title":"Proceedings of the 6th ACM Symposium on Theory of Computing (STOC\u201974)","author":"Garey M. R.","year":"1974","unstructured":"M. R. Garey, D. S. Johnson, and L. Stockmeyer. 1974. Some simplified NP-complete problems. In Proceedings of the 6th ACM Symposium on Theory of Computing (STOC\u201974). ACM, 47\u201363."},{"key":"e_1_3_2_64_2","first-page":"213","volume-title":"Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201921)","author":"Gilbert Michael S.","year":"2021","unstructured":"Michael S. Gilbert, Seher Acer, Erik G. Boman, Kamesh Madduri, and Sivasankaran Rajamanickam. 2021. Performance-portable graph coarsening for efficient multilevel graph analysis. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201921). 213\u2013222. 10.1109\/IPDPS49936.2021.00030"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/2851496"},{"key":"e_1_3_2_66_2","first-page":"35:1\u201335:12","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","author":"Godenschwager Christian","year":"2013","unstructured":"Christian Godenschwager, Florian Schornbaum, Martin Bauer, Harald K\u00f6stler, and Ulrich R\u00fcde. 2013. A framework for hybrid parallel flow simulations with a trillion cells in complex geometries. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. ACM, 35:1\u201335:12. 10.1145\/2503210.2503273"},{"key":"e_1_3_2_67_2","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg D. E.","year":"1989","unstructured":"D. E. Goldberg. 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley."},{"key":"e_1_3_2_68_2","first-page":"58","volume-title":"Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPS\u201916)","author":"Goodarzi Bahareh","year":"2016","unstructured":"Bahareh Goodarzi, Martin Burtscher, and Dhrubajyoti Goswami. 2016. Parallel graph partitioning on a CPU-GPU architecture. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPS\u201916). 58\u201366. 10.1109\/IPDPSW.2016.16"},{"key":"e_1_3_2_69_2","first-page":"769","volume-title":"Proceedings of the 17th International Conference on High Performance Computing and Simulation (HPCS\u201919)","author":"Goodarzi Bahareh","year":"2019","unstructured":"Bahareh Goodarzi, Farzad Khorasani, Vivek Sarkar, and Dhrubajyoti Goswami. 2019. High performance multilevel graph partitioning on GPU. In Proceedings of the 17th International Conference on High Performance Computing and Simulation (HPCS\u201919). 769\u2013778. 10.1109\/HPCS48598.2019.9188120"},{"key":"e_1_3_2_70_2","first-page":"11:1\u201311:15","volume-title":"Proceedings of the 18th International Symposium on Experimental Algorithms (SEA\u201920)","author":"Gottesb\u00fcren Lars","year":"2020","unstructured":"Lars Gottesb\u00fcren, Michael Hamann, Sebastian Schlag, and Dorothea Wagner. 2020. Advanced flow-based multilevel hypergraph partitioning. In Proceedings of the 18th International Symposium on Experimental Algorithms (SEA\u201920). 11:1\u201311:15. 10.4230\/LIPIcs.SEA.2020.11"},{"key":"e_1_3_2_71_2","first-page":"52:1\u201352:17","volume-title":"Proceedings of the 27th Annual European Symposium on Algorithms (ESA\u201919)","author":"Gottesb\u00fcren Lars","year":"2019","unstructured":"Lars Gottesb\u00fcren, Michael Hamann, and Dorothea Wagner. 2019. Evaluation of a flow-based hypergraph bipartitioning algorithm. In Proceedings of the 27th Annual European Symposium on Algorithms (ESA\u201919). 52:1\u201352:17. 10.4230\/LIPIcs.ESA.2019.52"},{"key":"e_1_3_2_72_2","first-page":"16","volume-title":"Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX\u201921)","author":"Gottesb\u00fcren Lars","year":"2021","unstructured":"Lars Gottesb\u00fcren, Tobias Heuer, Peter Sanders, and Sebastian Schlag. 2021. Scalable shared-memory hypergraph partitioning. In Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX\u201921). 16\u201330. 10.1137\/1.9781611976472.2"},{"key":"e_1_3_2_73_2","volume-title":"Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX\u201922)","author":"Gottesb\u00fcren Lars","year":"2022","unstructured":"Lars Gottesb\u00fcren, Tobias Heuer, Peter Sanders, and Sebastian Schlag. 2022. Shared-memory \\(n\\) -level hypergraph partitioning. In Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX\u201922). SIAM. https:\/\/arxiv.org\/abs\/2104.08107.to appear."},{"key":"e_1_3_2_74_2","volume-title":"Proceedings of the 24th Workshop on Algorithm Engineering and Experiments (ALENEX\u201922)","author":"Gottesb\u00fcren Lars","year":"2022","unstructured":"Lars Gottesb\u00fcren, Tobias Heuer, Peter Sanders, and Sebastian Schlag. 2022. Shared-memory \\(n\\) -level hypergraph partitioning. In Proceedings of the 24th Workshop on Algorithm Engineering and Experiments (ALENEX\u201922). SIAM. 10.1137\/1.9781611977042.11"},{"key":"e_1_3_2_75_2","first-page":"48:1\u201348:17","volume-title":"Proceedings of the 29th Annual European Symposium on Algorithms (ESA\u201921) (LIPIcs)","volume":"204","author":"Gottesb\u00fcren Lars","year":"2021","unstructured":"Lars Gottesb\u00fcren, Tobias Heuer, Peter Sanders, Christian Schulz, and Daniel Seemaier. 2021. Deep multilevel graph partitioning. In Proceedings of the 29th Annual European Symposium on Algorithms (ESA\u201921) (LIPIcs), Vol. 204. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 48:1\u201348:17. 10.4230\/LIPIcs.ESA.2021.48"},{"key":"e_1_3_2_76_2","unstructured":"Lars Gottesb\u00fcren and Michael Hamann. 2021. Deterministic parallel hypergraph partitioning. Retrieved from https:\/\/arxiv.org\/abs\/2112.12704."},{"key":"e_1_3_2_77_2","volume-title":"Proceedings of the 20th International Symposium on Experimental Algorithms","volume":"233","author":"Gottesb\u00fcren Lars","year":"2022","unstructured":"Lars Gottesb\u00fcren, Tobias Heuer, and Peter Sanders. 2022. Parallel flow-based hypergraph partitioning. In Proceedings of the 20th International Symposium on Experimental Algorithms, Vol. 233. LIPICS. Retrieved from https:\/\/arxiv.org\/abs\/2201.01556."},{"key":"e_1_3_2_78_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-03-15-410"},{"key":"e_1_3_2_79_2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BFb0030123","volume-title":"Proceedings of the 3rd International Workshop on Parallel Algorithms for Irregularly Structured Problems (IRREGULAR\u201996) (Lecture Notes in Computer Science)","volume":"1117","author":"Grigni Michelangelo","year":"1996","unstructured":"Michelangelo Grigni and Fredrik Manne. 1996. On the complexity of the generalized block distribution. In Proceedings of the 3rd International Workshop on Parallel Algorithms for Irregularly Structured Problems (IRREGULAR\u201996) (Lecture Notes in Computer Science), Afonso Ferreira, Jos\u00e9 D. P. Rolim, Yousef Saad, and Tao Yang (Eds.), Vol. 1117. Springer, 319\u2013326. 10.1007\/BFb0030123"},{"key":"e_1_3_2_80_2","first-page":"158","volume-title":"Proceedings of the 18th International Conference on Information Fusion (FUSION\u201915)","author":"Gutfraind Alexander","year":"2015","unstructured":"Alexander Gutfraind, Ilya Safro, and Lauren Ancel Meyers. 2015. Multiscale network generation. In Proceedings of the 18th International Conference on Information Fusion (FUSION\u201915). IEEE, 158\u2013165. https:\/\/ieeexplore.ieee.org\/document\/7266557\/."},{"key":"e_1_3_2_81_2","doi-asserted-by":"publisher","DOI":"10.1145\/3173045"},{"key":"e_1_3_2_82_2","series-title":"Proceedings of the 24th International Conference on Parallel and Distributed Computing","first-page":"688","volume":"11014","author":"Hamann Michael","year":"2018","unstructured":"Michael Hamann, Ben Strasser, Dorothea Wagner, and Tim Zeitz. 2018. Distributed graph clustering using modularity and map equation. In Proceedings of the 24th International Conference on Parallel and Distributed Computing(EuroPar\u201918) (Lecture Notes in Computer Science), Marco Aldinucci, Luca Padovani, and Massimo Torquati (Eds.), Vol. 11014. Springer, 688\u2013702. 10.1007\/978-3-319-96983-1_49"},{"key":"e_1_3_2_83_2","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777604"},{"issue":"2","key":"e_1_3_2_84_2","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0916028","article-title":"An improved spectral graph partitioning algorithm for mapping parallel computations","volume":"16","author":"Hendrickson B.","year":"1995","unstructured":"B. Hendrickson and R. Leland. 1995. An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J. Sci. Comput. 16, 2 (1995), 452\u2013469.","journal-title":"SIAM J. Sci. Comput."},{"key":"e_1_3_2_85_2","doi-asserted-by":"publisher","DOI":"10.1145\/3398634"},{"key":"e_1_3_2_86_2","first-page":"371","volume-title":"Proceedings of the 17th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID\u201917)","author":"Herrmann Julien","year":"2017","unstructured":"Julien Herrmann, Jonathan Kho, Bora U\u00e7ar, Kamer Kaya, and \u00dcmit V. \u00c7ataly\u00fcrek. 2017. Acyclic partitioning of large directed acyclic graphs. In Proceedings of the 17th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID\u201917). IEEE Computer Society\/ACM, 371\u2013380. 10.1109\/CCGRID.2017.101"},{"key":"e_1_3_2_87_2","doi-asserted-by":"publisher","DOI":"10.1137\/18M1176865"},{"key":"e_1_3_2_88_2","volume-title":"Engineering Initial Partitioning Algorithms for direct  \\(k\\) -way Hypergraph Partitioning","author":"Heuer Tobias","year":"2015","unstructured":"Tobias Heuer. 2015. Engineering Initial Partitioning Algorithms for direct \\(k\\) -way Hypergraph Partitioning. Bachelor Thesis. Karlsruhe Institute of Technology."},{"key":"e_1_3_2_89_2","first-page":"8:1\u20138:20","volume-title":"Proceedings of the 19th International Symposium on Experimental Algorithms (SEA\u201921)","volume":"190","author":"Heuer Tobias","year":"2021","unstructured":"Tobias Heuer, Nikolai Maas, and Sebastian Schlag. 2021. Multilevel hypergraph partitioning with vertex weights revisited. In Proceedings of the 19th International Symposium on Experimental Algorithms (SEA\u201921), Vol. 190. 8:1\u20138:20. 10.4230\/LIPIcs.SEA.2021.8"},{"key":"e_1_3_2_90_2","doi-asserted-by":"publisher","DOI":"10.1145\/3329872"},{"key":"e_1_3_2_91_2","first-page":"21:1\u201321:19","volume-title":"Proceedings of the 16th International Symposium on Experimental Algorithms (SEA\u201917)","author":"Heuer T.","year":"2017","unstructured":"T. Heuer and S. Schlag. 2017. Improving coarsening schemes for hypergraph partitioning by exploiting community structure. In Proceedings of the 16th International Symposium on Experimental Algorithms (SEA\u201917). 21:1\u201321:19. 10.4230\/LIPIcs.SEA.2017.21"},{"key":"e_1_3_2_92_2","first-page":"439","volume-title":"Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201919)","author":"Hoang Loc","year":"2019","unstructured":"Loc Hoang, Roshan Dathathri, Gurbinder Gill, and Keshav Pingali. 2019. Cusp: A customizable streaming edge partitioner for distributed graph analytics. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201919). IEEE, 439\u2013450. 10.1109\/IPDPS.2019.00054"},{"key":"e_1_3_2_93_2","first-page":"1","article-title":"Engineering a scalable high-quality graph partitioner","author":"Holtgrewe M.","year":"2010","unstructured":"M. Holtgrewe, P. Sanders, and C. Schulz. 2010. Engineering a scalable high-quality graph partitioner. Proceedings of the 24th IEEE International Parallal and Distributed Processing Symposium. 1\u201312.","journal-title":"Proceedings of the 24th IEEE International Parallal and Distributed Processing Symposium"},{"key":"e_1_3_2_94_2","unstructured":"Cupjin Huang Fang Zhang Michael Newman Junjie Cai Xun Gao Zhengxiong Tian Junyin Wu Haihong Xu Huanjun Yu Bo Yuan et\u00a0al. 2020. Classical simulation of quantum supremacy circuits. Retrieved from https:\/\/arXiv:2005.06787."},{"key":"e_1_3_2_95_2","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904486"},{"key":"e_1_3_2_96_2","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137650"},{"key":"e_1_3_2_97_2","first-page":"113","volume-title":"Proceedings of the International Conference on Parallel Processing, Vol. III: Algorithms and Applications","author":"Karypis George","year":"1995","unstructured":"George Karypis and Vipin Kumar. 1995. Multilevel graph partitioning schemes. In Proceedings of the International Conference on Parallel Processing, Vol. III: Algorithms and Applications. CRC Press, 113\u2013122."},{"key":"e_1_3_2_98_2","volume-title":"Proceedings of the ACM\/IEEE Conference on Supercomputing (Supercomputing\u201996)","author":"Karypis George","year":"1996","unstructured":"George Karypis and Vipin Kumar. 1996. Parallel multilevel K-way partitioning scheme for irregular graphs. In Proceedings of the ACM\/IEEE Conference on Supercomputing (Supercomputing\u201996). IEEE Computer Society. 10.1145\/369028.369103"},{"issue":"1","key":"e_1_3_2_99_2","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","article-title":"A fast and high-quality multilevel scheme for partitioning irregular graphs","volume":"20","author":"Karypis G.","year":"1998","unstructured":"G. Karypis and V. Kumar. 1998. A fast and high-quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 1 (1998), 359\u2013392.","journal-title":"SIAM J. Sci. Comput."},{"key":"e_1_3_2_100_2","first-page":"28","volume-title":"Proceedings of the ACM\/IEEE Conference on Supercomputing","author":"Karypis George","year":"1998","unstructured":"George Karypis and Vipin Kumar. 1998. Multilevel algorithms for multi-constraint graph partitioning. In Proceedings of the ACM\/IEEE Conference on Supercomputing. IEEE Computer Society, 28. 10.1109\/SC.1998.10018"},{"key":"e_1_3_2_101_2","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1403"},{"key":"e_1_3_2_102_2","doi-asserted-by":"publisher","DOI":"10.1155\/2000\/19436"},{"key":"e_1_3_2_103_2","first-page":"174","volume-title":"Proceedings of the 10th International Conference on Parallel Processing and Applied Mathematics (PPAM\u201913), Revised Selected Papers, Part II (LNCS)","volume":"8385","author":"Kaya Kamer","year":"2013","unstructured":"Kamer Kaya, Bora U\u00e7ar, and \u00dcmit V. \u00c7ataly\u00fcrek. 2013. Analysis of partitioning models and metrics in parallel sparse matrix-vector multiplication. In Proceedings of the 10th International Conference on Parallel Processing and Applied Mathematics (PPAM\u201913), Revised Selected Papers, Part II (LNCS), Vol. 8385. Springer, 174\u2013184. 10.1007\/978-3-642-55195-6_16"},{"key":"e_1_3_2_104_2","first-page":"39","volume-title":"Proceedings of the International Conference on Parallel Architectures and Compilation (PACT\u201915)","author":"Khorasani Farzad","year":"2015","unstructured":"Farzad Khorasani, Rajiv Gupta, and Laxmi N. Bhuyan. 2015. Scalable SIMD-efficient graph processing on GPUs. In Proceedings of the International Conference on Parallel Architectures and Compilation (PACT\u201915). IEEE Computer Society, 39\u201350. 10.1109\/PACT.2015.15"},{"key":"e_1_3_2_105_2","first-page":"146","volume-title":"Proceedings of the European Conference on Parallel Processing","author":"Kiefer Tim","year":"2016","unstructured":"Tim Kiefer, Dirk Habich, and Wolfgang Lehner. 2016. Penalized graph partitioning for static and dynamic load balancing. In Proceedings of the European Conference on Parallel Processing. Springer, 146\u2013158. 10.1007\/978-3-319-43659-3_11"},{"key":"e_1_3_2_106_2","first-page":"473","volume-title":"Proceedings of the 13th Genetic and Evolutionary Computation (GECCO\u201911)","author":"Kim Jin","year":"2011","unstructured":"Jin Kim, Inwook Hwang, Yong-Hyuk Kim, and Byung-Ro Moon. 2011. Genetic approaches for graph partitioning: A survey. In Proceedings of the 13th Genetic and Evolutionary Computation (GECCO\u201911). ACM, 473\u2013480. 10.1145\/2001576.2001642"},{"key":"e_1_3_2_107_2","first-page":"51","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC\u201913)","author":"Kirmani S.","year":"2013","unstructured":"S. Kirmani and P. Raghavan. 2013. Scalable parallel graph partitioning. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC\u201913). ACM, 51."},{"key":"e_1_3_2_108_2","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827500366124"},{"key":"e_1_3_2_109_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2020.04.033"},{"key":"e_1_3_2_110_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0362-1"},{"key":"e_1_3_2_111_2","first-page":"445","volume-title":"Proceedings of the 12th Asian Conference on Computer Vision, Revised Selected Papers, Part IV (LNCS)","volume":"9006","author":"Kumar Ratnesh","year":"2014","unstructured":"Ratnesh Kumar, Guillaume Charpiat, and Monique Thonnat. 2014. Multiple object tracking by efficient graph partitioning. In Proceedings of the 12th Asian Conference on Computer Vision, Revised Selected Papers, Part IV (LNCS), Vol. 9006. Springer, 445\u2013460. 10.1007\/978-3-319-16817-3_29"},{"key":"e_1_3_2_112_2","first-page":"68","volume-title":"Proceedings of the 14th International Symposium on Experimental Algorithms (SEA\u201915) (LNCS)","volume":"9125","author":"Lamm Sebastian","year":"2015","unstructured":"Sebastian Lamm, Peter Sanders, and Christian Schulz. 2015. Graph partitioning for independent sets. In Proceedings of the 14th International Symposium on Experimental Algorithms (SEA\u201915) (LNCS), Vol. 9125. Springer, 68\u201381. 10.1007\/978-3-319-20086-6_6"},{"key":"e_1_3_2_113_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2005.10.003"},{"key":"e_1_3_2_114_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.50"},{"key":"e_1_3_2_115_2","first-page":"236","volume-title":"Proceedings of the 45th International Conference on Parallel Processing (ICPP\u201916)","author":"LaSalle Dominique","year":"2016","unstructured":"Dominique LaSalle and George Karypis. 2016. A parallel hill-climbing refinement algorithm for graph partitioning. In Proceedings of the 45th International Conference on Parallel Processing (ICPP\u201916). IEEE, 236\u2013241. 10.1109\/ICPP.2016.34"},{"key":"e_1_3_2_116_2","first-page":"14:1\u201314:4","volume-title":"Proceedings of the 5th Workshop on Irregular Applications\u2014Architectures and Algorithms (IA3\u201915)","author":"LaSalle Dominique","year":"2015","unstructured":"Dominique LaSalle, Md. Mostofa Ali Patwary, Nadathur Satish, Narayanan Sundaram, Pradeep Dubey, and George Karypis. 2015. Improving graph partitioning for modern graphs and architectures. In Proceedings of the 5th Workshop on Irregular Applications\u2014Architectures and Algorithms (IA3\u201915). 14:1\u201314:4. 10.1145\/2833179.2833188"},{"key":"e_1_3_2_117_2","unstructured":"Yifan Li Xiaohui Yu and Nick Koudas. 2021. LES3: Learning-based exact set similarity search. Retrieved from https:\/\/arXiv:2107.10417."},{"key":"e_1_3_2_118_2","first-page":"476","volume-title":"Proceedings of the International Conference on Computational Science (ICCS\u201922)","author":"Liu Xiaoyuan","year":"2022","unstructured":"Xiaoyuan Liu, Hayato Ushijima-Mwesigwa, Indradeep Ghosh, and Ilya Safro. 2022. Partitioning dense graphs with hardware accelerators. In Proceedings of the International Conference on Computational Science (ICCS\u201922), Derek Groen, Cl\u00e9lia de Mulatier, Maciej Paszynski, Valeria V. Krzhizhanovskaya, Jack J. Dongarra, and Peter M. A. Sloot (Eds.). Springer International Publishing, Cham, 476\u2013483."},{"issue":"2","key":"e_1_3_2_119_2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","article-title":"Least squares quantization in PCM","volume":"28","author":"Lloyd S.","year":"1982","unstructured":"S. Lloyd. 1982. Least squares quantization in PCM. IEEE Trans. Info. Theory 28, 2 (1982), 129\u2013137.","journal-title":"IEEE Trans. Info. Theory"},{"key":"e_1_3_2_120_2","first-page":"159","volume-title":"Proceedings of the 21st International Conference on Parallel and Distributed Computing (EuroPar\u201915) (LNCS)","volume":"9233","author":"Lotfifar Foad","year":"2015","unstructured":"Foad Lotfifar and Matthew Johnson. 2015. A multi-level hypergraph partitioning algorithm using rough set clustering. In Proceedings of the 21st International Conference on Parallel and Distributed Computing (EuroPar\u201915) (LNCS), Vol. 9233. Springer, 159\u2013170. 10.1007\/978-3-662-48096-0_13"},{"key":"e_1_3_2_121_2","first-page":"161","volume-title":"Proceedings of the26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP\u201921)","author":"Maleki Sepideh","year":"2021","unstructured":"Sepideh Maleki, Udit Agarwal, Martin Burtscher, and Keshav Pingali. 2021. BiPart: A parallel and deterministic hypergraph partitioner. In Proceedings of the26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP\u201921). 161\u2013174. 10.1145\/3437801.3441611"},{"key":"e_1_3_2_122_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213017500117"},{"key":"e_1_3_2_123_2","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/3-540-62095-8_50","volume-title":"Proceedings of the3rd International Workshop on Applied Parallel Computing, Industrial Computation, and Optimization (PARA\u201996) (LNCS)","volume":"1184","author":"Manne Fredrik","year":"1996","unstructured":"Fredrik Manne and Tor S\u00f8revik. 1996. Partitioning an array onto a mesh of processors. In Proceedings of the3rd International Workshop on Applied Parallel Computing, Industrial Computation, and Optimization (PARA\u201996) (LNCS), Vol. 1184. Springer, 467\u2013477. 10.1007\/3-540-62095-8_50"},{"key":"e_1_3_2_124_2","first-page":"1083","volume-title":"Proceedings of the 33rd IEEE International Conference on Data Engineering (ICDE\u201917)","author":"Martella Claudio","year":"2017","unstructured":"Claudio Martella, Dionysios Logothetis, Andreas Loukas, and Georgos Siganos. 2017. Spinner: Scalable graph partitioning in the cloud. In Proceedings of the 33rd IEEE International Conference on Data Engineering (ICDE\u201917). IEEE Computer Society, 1083\u20131094. 10.1109\/ICDE.2017.153"},{"key":"e_1_3_2_125_2","doi-asserted-by":"publisher","DOI":"10.1145\/2818185"},{"key":"e_1_3_2_126_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2009.09.006"},{"key":"e_1_3_2_127_2","first-page":"351","volume-title":"Proceedings of the 13th International Symposium on Experimental Algorithms (LNCS)","volume":"8504","author":"Meyerhenke Henning","year":"2014","unstructured":"Henning Meyerhenke, Peter Sanders, and Christian Schulz. 2014. Partitioning complex networks via size-constrained clustering. In Proceedings of the 13th International Symposium on Experimental Algorithms (LNCS), Vol. 8504. Springer, 351\u2013363. 10.1007\/978-3-319-07959-2_30"},{"key":"e_1_3_2_128_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-016-9315-8"},{"key":"e_1_3_2_129_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2671868"},{"issue":"1","key":"e_1_3_2_130_2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/(SICI)1097-0363(19980115)26:1<57::AID-FLD625>3.0.CO;2-N","article-title":"Octree partitioning of hybrid grids for parallel adaptive viscous flow simulations","volume":"26","author":"Minyard T.","year":"1998","unstructured":"T. Minyard and Y. Kallinderis. 1998. Octree partitioning of hybrid grids for parallel adaptive viscous flow simulations. Int. J. Numer. Methods Fluids 26, 1 (1998), 57\u201378.","journal-title":"Int. J. Numer. Methods Fluids"},{"key":"e_1_3_2_131_2","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010749.ch60"},{"key":"e_1_3_2_132_2","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1145\/3205455.3205464","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u201918)","author":"Moreira O.","year":"2018","unstructured":"O. Moreira, M. Popp, and C. Schulz. 2018. Evolutionary multi-level acyclic graph partitioning. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u201918). 332\u2013339. 10.1145\/3205455.3205464"},{"key":"e_1_3_2_133_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-020-09448-8"},{"key":"e_1_3_2_134_2","article-title":"Parallel spectral graph partitioning","author":"Naumov Maxim","year":"2016","unstructured":"Maxim Naumov and Timothy Moon. 2016. Parallel spectral graph partitioning. NVIDIA Technical Report.","journal-title":"NVIDIA Technical Report"},{"key":"e_1_3_2_135_2","first-page":"25","volume-title":"Proceedings of the 18th International Conference on Extending Database Technology (EDBT\u201915)","author":"Nicoara Daniel","year":"2015","unstructured":"Daniel Nicoara, Shahin Kamali, Khuzaima Daudjee, and Lei Chen. 2015. Hermes: Dynamic partitioning for distributed social network graph databases. In Proceedings of the 18th International Conference on Extending Database Technology (EDBT\u201915). 25\u201336. 10.5441\/002\/edbt.2015.04"},{"key":"e_1_3_2_136_2","first-page":"278","volume-title":"Proceedings of the 18th European Conference on Algorithms: Part I (LNCS)","volume":"6346","author":"Osipov V.","year":"2010","unstructured":"V. Osipov and P. Sanders. 2010. \\(n\\) -level graph partitioning. In Proceedings of the 18th European Conference on Algorithms: Part I (LNCS), Vol. 6346. Springer, 278\u2013289. 10.1007\/978-3-642-15775-2_24"},{"key":"e_1_3_2_137_2","unstructured":"Feng Pan and Pan Zhang. 2021. Simulating the sycamore quantum supremacy circuits. Retrieved from https:\/\/arXiv:2103.03074."},{"key":"e_1_3_2_138_2","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010749.ch61"},{"key":"e_1_3_2_139_2","doi-asserted-by":"publisher","DOI":"10.1109\/71.491582"},{"key":"e_1_3_2_140_2","first-page":"1","volume-title":"Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX\u201921)","author":"Popp Merten","year":"2021","unstructured":"Merten Popp, Sebastian Schlag, Christian Schulz, and Daniel Seemaier. 2021. Multilevel acyclic hypergraph partitioning. In Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX\u201921). SIAM, 1\u201315. 10.1137\/1.9781611976472.1"},{"issue":"3","key":"e_1_3_2_141_2","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","article-title":"Partitioning sparse matrices with eigenvectors of graphs","volume":"11","author":"Pothen A.","year":"1990","unstructured":"A. Pothen, H. D. Simon, and K. P. Liou. 1990. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11, 3 (1990), 430\u2013452.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"e_1_3_2_142_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2896951"},{"key":"e_1_3_2_143_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"e_1_3_2_144_2","first-page":"51","volume-title":"Proceedings of the 7th IEEE International Conference on Self-Adaptive and Self-Organizing Systems","author":"Rahimian Fatemeh","year":"2013","unstructured":"Fatemeh Rahimian, Amir H. Payberah, Sarunas Girdzijauskas, M\u00e1rk Jelasity, and Seif Haridi. 2013. JA-BE-JA: A distributed algorithm for balanced graph partitioning. In Proceedings of the 7th IEEE International Conference on Self-Adaptive and Self-Organizing Systems. IEEE Computer Society, 51\u201360. 10.1109\/SASO.2013.13"},{"key":"e_1_3_2_145_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13675-020-00126-9"},{"key":"e_1_3_2_146_2","doi-asserted-by":"publisher","DOI":"10.1137\/100791142"},{"issue":"2","key":"e_1_3_2_147_2","article-title":"Memetic algorithm with hungarian matching based crossover and diversity preservation","volume":"22","author":"Ruiz Emmanuel Romero","year":"2018","unstructured":"Emmanuel Romero Ruiz and Carlos Segura. 2018. Memetic algorithm with hungarian matching based crossover and diversity preservation. Computaci\u00f3n y Sistemas 22, 2 (2018). Retrieved from http:\/\/www.cys.cic.ipn.mx\/ojs\/index.php\/CyS\/article\/view\/2951.","journal-title":"Computaci\u00f3n y Sistemas"},{"key":"e_1_3_2_148_2","volume-title":"Engineering Multilevel Graph Partitioning Algorithms","author":"Sanders P.","year":"2010","unstructured":"P. Sanders and C. Schulz. 2010. Engineering Multilevel Graph Partitioning Algorithms. Technical Report. Karlsruhe Institute of Technology. Retrieved from https:\/\/arXiv:1012.0006v3."},{"key":"e_1_3_2_149_2","first-page":"469","volume-title":"Proceedings of the 19th European Symposium on Algorithms (LNCS)","volume":"6942","author":"Sanders P.","year":"2011","unstructured":"P. Sanders and C. Schulz. 2011. Engineering multilevel graph partitioning algorithms. In Proceedings of the 19th European Symposium on Algorithms (LNCS), Vol. 6942. Springer, 469\u2013480. 10.1007\/978-3-642-23719-5_40"},{"key":"e_1_3_2_150_2","first-page":"16","volume-title":"Proceedings of the 12th Workshop on Algorithm Engineering and Experimentation (ALENEX\u201912)","author":"Sanders P.","year":"2012","unstructured":"P. Sanders and C. Schulz. 2012. Distributed evolutionary graph partitioning. In Proceedings of the 12th Workshop on Algorithm Engineering and Experimentation (ALENEX\u201912). 16\u201329. 10.1137\/1.9781611972924.2"},{"key":"e_1_3_2_151_2","volume-title":"Think Locally, Act Globally: Perfectly Balanced Graph Partitioning","author":"Sanders P.","year":"2012","unstructured":"P. Sanders and C. Schulz. 2012. Think Locally, Act Globally: Perfectly Balanced Graph Partitioning. Technical Report. Karlsruhe Institute of Technology. Retrieved from https:\/\/arXiv:1210.0477."},{"key":"e_1_3_2_152_2","volume-title":"Proceedings of the 12th International Symposium on Experimental Algorithms (SEA\u201912)","author":"Sanders P.","year":"2013","unstructured":"P. Sanders and C. Schulz. 2013. Think locally, act globally: Highly balanced graph partitioning, In Proceedings of the 12th International Symposium on Experimental Algorithms (SEA\u201912). Retrieved from https:\/\/arXiv:1210.0477. 10.1007\/978-3-642-38527-8_16"},{"key":"e_1_3_2_153_2","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/3071178.3071204","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u201917)","author":"Sanders Peter","year":"2017","unstructured":"Peter Sanders, Christian Schulz, Darren Strash, and Robert Williger. 2017. Distributed evolutionary k-way node separators. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u201917). ACM, 345\u2013352. 10.1145\/3071178.3071204"},{"key":"e_1_3_2_154_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(91)90074-J"},{"key":"e_1_3_2_155_2","volume-title":"High-quality Hypergraph Partitioning","author":"Schlag Sebastian","year":"2020","unstructured":"Sebastian Schlag. 2020. High-quality Hypergraph Partitioning. Ph.D. Dissertation. Karlsruhe Institute of Technology, Germany. Retrieved from https:\/\/nbn-resolving.org\/urn:nbn:de:101:1-2020030403581620165765."},{"key":"e_1_3_2_156_2","first-page":"53","volume-title":"Proceedings of the 18th Workshop on Algorithm Engineering and Experiments (ALENEX\u201916)","author":"Schlag Sebastian","year":"2016","unstructured":"Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, and Christian Schulz. 2016. k-way hypergraph partitioning via n-level recursive bisection. In Proceedings of the 18th Workshop on Algorithm Engineering and Experiments (ALENEX\u201916). SIAM, 53\u201367. 10.1137\/1.9781611974317.5"},{"key":"e_1_3_2_157_2","first-page":"211","volume-title":"Proceedings of the 21st Workshop on Algorithm Engineering and Experiments (ALENEX\u201919)","author":"Schlag Sebastian","year":"2019","unstructured":"Sebastian Schlag, Christian Schulz, Daniel Seemaier, and Darren Strash. 2019. Scalable edge partitioning. In Proceedings of the 21st Workshop on Algorithm Engineering and Experiments (ALENEX\u201919). SIAM, 211\u2013225. 10.1137\/1.9781611975499.17"},{"key":"e_1_3_2_158_2","first-page":"322","volume-title":"Proceedings of the 5th International Euro-Par Conference (EuroPar\u201999) (Lecture Notes in Computer Science)","volume":"1685","author":"Schloegel Kirk","year":"1999","unstructured":"Kirk Schloegel, George Karypis, and Vipin Kumar. 1999. A new algorithm for multi-objective graph partitioning. In Proceedings of the 5th International Euro-Par Conference (EuroPar\u201999) (Lecture Notes in Computer Science), Patrick Amestoy, Philippe Berger, Michel J. Dayd\u00e9, Iain S. Duff, Val\u00e9rie Frayss\u00e9, Luc Giraud, and Daniel Ruiz (Eds.), Vol. 1685. Springer, 322\u2013331. 10.1007\/3-540-48311-X_42"},{"key":"e_1_3_2_159_2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1109\/CLUSTR.2001.959987","volume-title":"Proceedings of the IEEE International Conference on Cluster Computing (CLUSTER\u201901)","author":"Schloegel Kirk","year":"2001","unstructured":"Kirk Schloegel, George Karypis, and Vipin Kumar. 2001. Graph partitioning for dynamic, adaptive and multi-phase scientific simulations. In Proceedings of the IEEE International Conference on Cluster Computing (CLUSTER\u201901). IEEE Computer Society, 271\u2013273. 10.1109\/CLUSTR.2001.959987"},{"key":"e_1_3_2_160_2","first-page":"491","volume-title":"Sourcebook of Parallel Computing","author":"Schloegel K.","year":"2003","unstructured":"K. Schloegel, G. Karypis, and V. Kumar. 2003. Graph partitioning for high-performance scientific simulations. In Sourcebook of Parallel Computing. Morgan Kaufmann Publishers, 491\u2013541."},{"key":"e_1_3_2_161_2","doi-asserted-by":"publisher","DOI":"10.5445\/IR\/1000035713"},{"key":"e_1_3_2_162_2","first-page":"4","volume-title":"The Trinity Graph Engine","author":"Shao Bin","year":"2012","unstructured":"Bin Shao, Haixun Wang, and Yatao Li. 2012. The Trinity Graph Engine. Technical Report. Microsoft Research Asia. 4 pages."},{"key":"e_1_3_2_163_2","doi-asserted-by":"publisher","DOI":"10.1137\/17M1152735"},{"key":"e_1_3_2_164_2","first-page":"2:1\u20132:15","volume-title":"Proceedings of the 17th International Symposium on Experimental Algorithms (SEA\u201918) (LIPIcs)","volume":"103","author":"Shaydulin Ruslan","year":"2018","unstructured":"Ruslan Shaydulin and Ilya Safro. 2018. Aggregative coarsening for multilevel hypergraph partitioning. In Proceedings of the 17th International Symposium on Experimental Algorithms (SEA\u201918) (LIPIcs), Gianlorenzo D\u2019Angelo (Ed.), Vol. 103. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 2:1\u20132:15. 10.4230\/LIPIcs.SEA.2018.2"},{"issue":"2","key":"e_1_3_2_165_2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0956-0521(91)90014-V","article-title":"Partitioning of unstructured problems for parallel processing","volume":"2","author":"Simon H. D.","year":"1991","unstructured":"H. D. Simon. 1991. Partitioning of unstructured problems for parallel processing. Comput. Syst. Eng. 2, 2 (1991), 135\u2013148.","journal-title":"Comput. Syst. Eng."},{"key":"e_1_3_2_166_2","doi-asserted-by":"publisher","DOI":"10.1137\/15M1026183"},{"key":"e_1_3_2_167_2","first-page":"646","volume-title":"Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201917)","author":"Slota George M.","year":"2017","unstructured":"George M. Slota, Sivasankaran Rajamanickam, Karen D. Devine, and Kamesh Madduri. 2017. Partitioning trillion-edge graphs in minutes. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201917). 646\u2013655. 10.1109\/IPDPS.2017.95"},{"key":"e_1_3_2_168_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3002150"},{"key":"e_1_3_2_169_2","first-page":"218","volume-title":"Proceedings of the Annual Symposium on Principles of Programming Languages (POPL\u201990)","author":"Steele Guy L.","year":"1990","unstructured":"Guy L. Steele. 1990. Making asynchronous parallelism safe for the world. In Proceedings of the Annual Symposium on Principles of Programming Languages (POPL\u201990). ACM Press, 218\u2013231. 10.1145\/96709.96731"},{"issue":"22","key":"e_1_3_2_170_2","doi-asserted-by":"crossref","first-page":"3809","DOI":"10.1002\/nme.1620372205","article-title":"A study of the factorization fill-in for a parallel implementation of the finite element method","volume":"37","author":"Taylor Valerie E.","year":"1994","unstructured":"Valerie E. Taylor and Bahram Nour-Omid. 1994. A study of the factorization fill-in for a parallel implementation of the finite element method. Int. J. Numer. Methods Eng. 37, 22 (1994), 3809\u20133823.","journal-title":"Int. J. Numer. Methods Eng."},{"key":"e_1_3_2_171_2","volume-title":"Proceedings of the 18th International Parallel and Distributed Processing Symposium","author":"Trifunovic Aleksandar","year":"2004","unstructured":"Aleksandar Trifunovic and William J. Knottenbelt. 2004. Towards a parallel disk-based algorithm for multilevel k-way hypergraph partitioning. In Proceedings of the 18th International Parallel and Distributed Processing Symposium. IEEE Computer Society. 10.1109\/IPDPS.2004.1303286"},{"key":"e_1_3_2_172_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3097283"},{"key":"e_1_3_2_173_2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/2556195.2556213","volume-title":"Proceedings of the 7th ACM International Conference on Web Search and Data Mining","author":"Tsourakakis Charalampos","year":"2014","unstructured":"Charalampos Tsourakakis, Christos Gkantsidis, Bozidar Radunovic, and Milan Vojnovic. 2014. Fennel: Streaming graph partitioning for massive scale graphs. In Proceedings of the 7th ACM International Conference on Web Search and Data Mining. 333\u2013342. 10.1145\/2556195.2556213"},{"key":"e_1_3_2_174_2","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827502410463"},{"key":"e_1_3_2_175_2","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1145\/2433396.2433461","volume-title":"Proceedings of the 6th ACM International Conference on Web Search and Data Mining (WSDM\u201913)","author":"Ugander Johan","year":"2013","unstructured":"Johan Ugander and Lars Backstrom. 2013. Balanced label propagation for partitioning massive graphs. In Proceedings of the 6th ACM International Conference on Web Search and Data Mining (WSDM\u201913). ACM, 507\u2013516. 10.1145\/2433396.2433461"},{"key":"e_1_3_2_176_2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/3149526.3149531","volume-title":"Proceedings of the 2nd International Workshop on Post Moores Era Supercomputing (PMES\u201917)","author":"Ushijima-Mwesigwa Hayato","year":"2017","unstructured":"Hayato Ushijima-Mwesigwa, Christian F. A. Negre, and Susan M. Mniszewski. 2017. Graph partitioning using quantum annealing on the D-wave system. In Proceedings of the 2nd International Workshop on Post Moores Era Supercomputing (PMES\u201917). Association for Computing Machinery, New York, NY, 22\u201329. 10.1145\/3149526.3149531"},{"key":"e_1_3_2_177_2","first-page":"144","volume-title":"Proceedings of the IEEE 34th International Conference on Distributed Computing Systems","author":"Vaquero Luis M.","year":"2014","unstructured":"Luis M. Vaquero, Felix Cuadrado, Dionysios Logothetis, and Claudio Martella. 2014. Adaptive partitioning for large-scale dynamic graphs. In Proceedings of the IEEE 34th International Conference on Distributed Computing Systems. IEEE, 144\u2013153. 10.1109\/ICDCS.2014.23"},{"key":"e_1_3_2_178_2","first-page":"52:1\u201352:10","volume-title":"Proceedings of the 47th International Conference on Parallel Processing (ICPP\u201918)","author":"Looz Moritz von","year":"2018","unstructured":"Moritz von Looz, Charilaos Tzovas, and Henning Meyerhenke. 2018. Balanced k-means for parallel geometric partitioning. In Proceedings of the 47th International Conference on Parallel Processing (ICPP\u201918). ACM, 52:1\u201352:10. 10.1145\/3225058.3225148"},{"key":"e_1_3_2_179_2","first-page":"353","volume-title":"Proceedings of the 15th International Symposium on Experimental Algorithms (SEA\u201916) (LNCS)","volume":"9685","author":"Looz Moritz von","year":"2016","unstructured":"Moritz von Looz, Mario Wolter, Christoph R. Jacob, and Henning Meyerhenke. 2016. Better partitions of protein graphs for subsystem quantum chemistry. In Proceedings of the 15th International Symposium on Experimental Algorithms (SEA\u201916) (LNCS), Vol. 9685. Springer, 353\u2013368. 10.1007\/978-3-319-38851-9_24"},{"key":"e_1_3_2_180_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3748-6_2"},{"issue":"2","key":"e_1_3_2_181_2","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1006\/jpdc.1997.1407","article-title":"Parallel dynamic graph partitioning for adaptive unstructured meshes","volume":"47","author":"Walshaw C.","year":"1997","unstructured":"C. Walshaw, M. Cross, and M. G. Everett. 1997. Parallel dynamic graph partitioning for adaptive unstructured meshes. J. Parallel Distrib. Comput. 47, 2 (1997), 102\u2013108.","journal-title":"J. Parallel Distrib. Comput."},{"key":"e_1_3_2_182_2","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1407"},{"key":"e_1_3_2_183_2","first-page":"568","volume-title":"Proceedings of the IEEE 30th International Conference on Data Engineering","author":"Wang Lu","year":"2014","unstructured":"Lu Wang, Yanghua Xiao, Bin Shao, and Haixun Wang. 2014. How to partition a billion-node graph. In Proceedings of the IEEE 30th International Conference on Data Engineering. IEEE Computer Society, 568\u2013579. 10.1109\/ICDE.2014.6816682"},{"key":"e_1_3_2_184_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4380-9_16"},{"key":"e_1_3_2_185_2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4330030502"},{"key":"e_1_3_2_186_2","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733097"},{"key":"e_1_3_2_187_2","first-page":"50","volume-title":"Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design (ICCAD\u201994)","author":"Yang Honghua","year":"1994","unstructured":"Honghua Yang and D. F. Wong. 1994. Efficient network flow based min-cut balanced partitioning. In Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design (ICCAD\u201994). IEEE Computer Society\/ACM, 50\u201355. 10.1109\/ICCAD.1994.629743"},{"key":"e_1_3_2_188_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.01.009"},{"key":"e_1_3_2_189_2","first-page":"363","volume-title":"Proceedings of the IEEE International Conference on Communication (ICC\u201915)","author":"Yao Long","year":"2015","unstructured":"Long Yao, Peilin Hong, Wen Zhang, Jianfei Li, and Dan Ni. 2015. Controller placement and flow based dynamic management problem towards SDN. In Proceedings of the IEEE International Conference on Communication (ICC\u201915). IEEE, 363\u2013368. 10.1109\/ICCW.2015.7247206"},{"key":"e_1_3_2_190_2","unstructured":"Abdurrahman Yasar Muhammed Fatih Balin Xiaojing An Kaan Sancak and \u00dcmit V. \u00c7ataly\u00fcrek. 2020. On symmetric rectilinear matrix partitioning. Retrieved from https:\/\/arxiv.org\/abs\/2009.07735."},{"key":"e_1_3_2_191_2","unstructured":"Abdurrahman Yasar and \u00dcmit V. \u00c7ataly\u00fcrek. 2019. Heuristics for symmetric rectilinear matrix partitioning. Retrieved from http:\/\/arxiv.org\/abs\/1909.12209."},{"key":"e_1_3_2_192_2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511755392","volume-title":"Essentials of Statistical Inference","author":"Young G. Alastair","year":"2005","unstructured":"G. Alastair Young, Thomas A. Severini, George Albert Young, R. L. Smith, et\u00a0al. 2005. Essentials of Statistical Inference. Vol. 16. Cambridge University Press."},{"key":"e_1_3_2_193_2","first-page":"231","volume-title":"Proceedings of the IFIP International Conference on Network and Parallel Computing (LNCS)","volume":"12639","author":"Yu Xiaosong","year":"2020","unstructured":"Xiaosong Yu, Huihui Ma, Zhengyu Qu, Jianbin Fang, and Weifeng Liu. 2020. NUMA-aware optimization of sparse matrix-vector multiplication on armv8-based many-core architectures. In Proceedings of the IFIP International Conference on Network and Parallel Computing (LNCS), Vol. 12639. Springer, 231\u2013242. 10.1007\/978-3-030-79478-1_20"},{"key":"e_1_3_2_194_2","doi-asserted-by":"crossref","unstructured":"Da Zheng Xiang Song Chengru Yang Dominique LaSalle Qidong Su Minjie Wang Chao Ma and George Karypis. 2021. Distributed hybrid CPU and GPU training for graph neural networks on billion-scale graphs. Retrieved from https:\/\/arxiv.org\/abs\/2112.15345.","DOI":"10.1145\/3534678.3539177"},{"key":"e_1_3_2_195_2","article-title":"Learning from labeled and unlabeled data with label propagation","author":"Zhu Xiaojin","year":"2002","unstructured":"Xiaojin Zhu and Zoubin Ghahramani. 2002. Learning from labeled and unlabeled data with label propagation. Technical Report.","journal-title":"Technical Report"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3571808","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3571808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:48Z","timestamp":1750182528000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3571808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,2]]},"references-count":194,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,12,31]]}},"alternative-id":["10.1145\/3571808"],"URL":"https:\/\/doi.org\/10.1145\/3571808","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,2]]},"assertion":[{"value":"2022-06-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-11-14","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-03-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}