mlsanityData to 7 Oct 2026

More Recent Advances in (Hyper)Graph Partitioning

arXiv 2205.13202 ↗First posted 26 May 2022cs.DS cs.LGcited by 12

Not on the map. Why?

Abstract (arXiv)

In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms. We survey trends of the last 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. In particular, the survey extends the previous survey by also covering hypergraph partitioning and streaming algorithms, and has an additional focus on parallel algorithms.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 48 of its 235 references that are in the map. First posted on arXiv 26 May 2022.

Builds on

48 of 235 references.

References · 48

  1. 2013Recent Advances in Graph Partitioningcited by 24
  2. 2021High-Quality Hypergraph Partitioningcited by 10
  3. 2015k-way Hypergraph Partitioning via n-Level Recursive Bisectioncited by 7
  4. 2017Social Hash Partitioner: A Scalable Distributed Hypergraph Partitionercited by 7
  5. 2017ADWISE: Adaptive Window-based Streaming Edge Partitioning for High-Speed Graph Processingcited by 5
  6. 2018Scalable Edge Partitioningcited by 5
  7. 2014Spinner: Scalable Graph Partitioning in the Cloudcited by 4
  8. 2015Graph Bisection with Pareto-Optimizationcited by 4
  9. 2017Memetic Multilevel Hypergraph Partitioningcited by 4
  10. 2019Window-based Streaming Graph Partitioning Algorithmcited by 4
  11. 2014Parallel Graph Partitioning for Complex Networkscited by 3
  12. 2015Distributed Balanced Partitioning via Linear Embeddingcited by 3
36 more
  1. 2016Partitioning Trillion-edge Graphs in Minutescited by 3
  2. 2017High-Quality Shared-Memory Graph Partitioningcited by 3
  3. 2018Network Flow-Based Refinement for Multilevel Hypergraph Partitioningcited by 3
  4. 2020Advanced Flow-Based Multilevel Hypergraph Partitioningcited by 3
  5. 2020Prioritized Restreaming Algorithms for Balanced Graph Partitioningcited by 3
  6. 2021Deep Multilevel Graph Partitioningcited by 3
  7. 2014Tree-based Coarsening and Partitioning of Complex Networkscited by 2
  8. 2014Partitioning Complex Networks via Size-constrained Clusteringcited by 2
  9. 2014Algorithms for Mapping Parallel Processes onto Grid and Torus Architecturescited by 2
  10. 2015Graph Partitioning for Independent Setscited by 2
  11. 2017Better Process Mapping and Sparse Quadratic Assignmentcited by 2
  12. 2018ILP-based Local Search for Graph Partitioningcited by 2
  13. 2018Balanced k-means for Parallel Geometric Partitioningcited by 2
  14. 2020Multilevel Acyclic Hypergraph Partitioningcited by 2
  15. 2020Scalable Shared-Memory Hypergraph Partitioningcited by 2
  16. 2020BiPart: A Parallel and Deterministic Multilevel Hypergraph Partitionercited by 2
  17. 2021Multilevel Hypergraph Partitioning with Vertex Weights Revisitedcited by 2
  18. 2021Buffered Streaming Graph Partitioningcited by 2
  19. 2021Sphynx: a parallel multi-GPU graph partitioner for distributed-memory systemscited by 2
  20. 2021LES3: Learning-based Exact Set Similarity Searchcited by 2
  21. 2022Parallel Flow-Based Hypergraph Partitioningcited by 2
  22. 2016Better partitions of protein graphs for subsystem quantum chemistrycited by 1
  23. 2017Distributed Evolutionary k-way Node Separatorscited by 1
  24. 2017Distributed Graph Clustering using Modularity and Map Equationcited by 1
  25. 2018Aggregative Coarsening for Multilevel Hypergraph Partitioningcited by 1
  26. 2018Evolutionary n-level Hypergraph Partitioning with Adaptive Coarseningcited by 1
  27. 2018Topology-induced Enhancement of Mappingscited by 1
  28. 2019Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithmcited by 1
  29. 2019Heuristics for Symmetric Rectilinear Matrix Partitioningcited by 1
  30. 2020High-Quality Hierarchical Process Mappingcited by 1
  31. 2020Efficient Process-to-Node Mapping Algorithms for Stencil Computationscited by 1
  32. 2020On Symmetric Rectilinear Matrix Partitioningcited by 1
  33. 2021Streaming Hypergraph Partitioning Algorithms on Limited Memory Environmentscited by 1
  34. 2021Shared-Memory n-level Hypergraph Partitioningcited by 1
  35. 2021An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architecturescited by 1
  36. 2021Deterministic Parallel Hypergraph Partitioningcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 3; 2024: 4; 2025: 1; 2026: 3.

12 papers.