GPU multi-level hypergraph partitioning with incidence constraints achieves up to 940x speedup and 2-26% better connectivity than sequential methods.
Multilevel hypergraph partitioning: Applications in vlsi domain,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Incidence Constraints in Hypergraph Partitioning on GPU
GPU multi-level hypergraph partitioning with incidence constraints achieves up to 940x speedup and 2-26% better connectivity than sequential methods.