A new greedy rebalancing algorithm for multi-constraint hypergraphs, integrated into Mt-KaHyPar, reduces geometric mean connectivity by 11.5% versus Metis while improving partition balance reliability.
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
High-Quality Multi-Constraint Hypergraph Partitioning via Greedy Rebalancing
A new greedy rebalancing algorithm for multi-constraint hypergraphs, integrated into Mt-KaHyPar, reduces geometric mean connectivity by 11.5% versus Metis while improving partition balance reliability.