Linear-time multilevel graph partitioning via edge sparsification

DOI10.4230/LIPICS.ESA.2025.32MaRDI QIDQ7322424zbMATH OpenFDO

Authors Lars Gottesbüren, Dominik Rosch, Peter Sanders, Daniel Seemaier

Publication date 31 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2025.32

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
• Algorithm 1003: Mongoose, a graph coarsening and partitioning library
• Benchmarking optimization software with performance profiles.
• Buffered Streaming Graph Partitioning
• Deep multilevel graph partitioning
• Efficient generation of networks with given expected degrees
• Fast unfolding of communities in large networks
• Faster cut sparsification of weighted graphs
• Faster fully compressed pattern matching by recompression
• Graph Partitioning and Graph Clustering
• Graph sparsification by effective resistances
• scientific article; zbMATH DE number 1256718 (Why is no real title available?)
• Improving coarsening schemes for hypergraph partitioning by exploiting community structure
• Jet: multilevel graph partitioning on graphics processing units
• Parallel unconstrained local search for partitioning irregular graphs
• Scalable high-quality hypergraph partitioning
• Scalable Shared-Memory Hypergraph Partitioning
• The University of Florida sparse matrix collection

This page was built for publication: Linear-time multilevel graph partitioning via edge sparsification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322424)