Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure

DOI10.4230/LIPIcs.SEA.2017.21zbMath1433.68298OpenAlexW2746116296MaRDI QIDQ4580175

Sebastian Schlag, Tobias Heuer

Publication date: 13 August 2018

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

zbMATH Keywords

community detectioncoarsening algorithmsmultilevel hypergraph partitioning

Mathematics Subject Classification ID

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

Related Items

Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm, Network Flow-Based Refinement for Multilevel Hypergraph Partitioning