A new algorithm finds a matroid basis in tilde O(n to the 3/7) adaptive rounds via independence oracle.
Hypergraph partitioning for sparse matrix-matrix multiplication,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
GPU algorithm for hypergraph partitioning with size and distinct hyperedge constraints achieves 380x speedup and 1.2-2.0x better connectivity than sequential methods.
citing papers explorer
-
An $\widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
A new algorithm finds a matroid basis in tilde O(n to the 3/7) adaptive rounds via independence oracle.
-
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.