Improving coarsening schemes for hypergraph partitioning by exploiting community structure

DOI10.4230/LIPICS.SEA.2017.21zbMATH Open1433.68298OpenAlexW2746116296MaRDI QIDQ4580175FDOQ4580175

Authors: Tobias Heuer, Sebastian Schlag 

Publication date: 13 August 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.SEA.2017.21

Recommendations

• Relaxation-based coarsening for multilevel hypergraph partitioning
• Aggregative coarsening for multilevel hypergraph partitioning
• \(k\)-way hypergraph partitioning via \(n\)-level recursive bisection
• Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
• Parallel multilevel algorithms for hypergraph partitioning

zbMATH Keywords

community detectioncoarsening algorithmsmultilevel hypergraph partitioning

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Hypergraphs (05C65)

Cited In (4)

• Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
• Relaxation-based coarsening for multilevel hypergraph partitioning
• Deterministic Parallel Hypergraph Partitioning
• Network Flow-Based Refinement for Multilevel Hypergraph Partitioning

This page was built for publication: Improving coarsening schemes for hypergraph partitioning by exploiting community structure

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