2026-07-20T05:44:38Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7622 2024-03-06T10:39:49Z ddc:004 open_access

Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure Heuer, Tobias Schlag, Sebastian multilevel hypergraph partitioning coarsening algorithms community detection We present an improved coarsening process for multilevel hypergraph partitioning that incorporates global information about the community structure. Community detection is performed via modularity maximization on a bipartite graph representation. The approach is made suitable for different classes of hypergraphs by defining weights for the graph edges that express structural properties of the hypergraph. We integrate our approach into a leading multilevel hypergraph partitioner with strong local search algorithms and perform extensive experiments on a large benchmark set of hypergraphs stemming from application areas such as VLSI design, SAT solving, and scientific computing. Our results indicate that respecting community structure during coarsening not only significantly improves the solutions found by the initial partitioning algorithm, but also consistently improves overall solution quality. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Tobias Heuer and Sebastian Schlag 2017 Is Part Of LIPIcs, Volume 75, 16th International Symposium on Experimental Algorithms (SEA 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SEA.2017.21 urn:nbn:de:0030-drops-76226 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2017.21 eng https://creativecommons.org/licenses/by/3.0/legalcode