GPU algorithm for hypergraph partitioning with size and distinct hyperedge constraints achieves 380x speedup and 1.2-2.0x better connectivity than sequential methods.
Bipart: a parallel and deterministic hypergraph partitioner
1 Pith paper cite this work, alongside 15 external citations. Polarity classification is still indexing.
1
Pith paper citing it
15
external citations · external index
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Hypergraph Partitioning on GPU with Distinct Incident Hyperedges and Size Constraints
GPU algorithm for hypergraph partitioning with size and distinct hyperedge constraints achieves 380x speedup and 1.2-2.0x better connectivity than sequential methods.