Local-max hypergraph matching gets O(log m)-round parallel algorithms with a 1/d approximation guarantee, plus a GPU implementation up to 76x faster than a single core.
10.1007/978-3-642-30397-5_10
1 Pith paper cite this work, alongside 43 external citations. Polarity classification is still indexing.
1
Pith paper citing it
43
external citations · OpenAlex
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Efficient Parallel Algorithms for Hypergraph Matching
Local-max hypergraph matching gets O(log m)-round parallel algorithms with a 1/d approximation guarantee, plus a GPU implementation up to 76x faster than a single core.