Pith. sign in

In: 18th WAOA (2020)

Hanguir, O · 2020 · Lecture notes in computer science · DOI 10.1007/978-3-030-80879-2_3

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

fields

cs.DS 1

years

2026 1

verdicts

CONDITIONAL 1

representative citing papers

Efficient Parallel Algorithms for Hypergraph Matching

cs.DS · 2026-02-26 · conditional · novelty 4.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Efficient Parallel Algorithms for Hypergraph Matching cs.DS · 2026-02-26 · conditional · none · ref 28

    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.