Pith. sign in

In: ALENEX 2008 (2008)

Geisberger, R · 2008 · Society for Industrial and Applied Mathematics eBooks · DOI 10.1137/1.9781611972887.9

1 Pith paper cite this work, alongside 199 external citations. Polarity classification is still indexing.

1 Pith paper citing it
199 external citations · OpenAlex
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 22

    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.