Randomized LOCAL-model algorithms achieve 2+ε-approximate maximum matching and approximate minimum vertex cover in O(log n / log² log n) rounds via a generalized graph decomposition, establishing that n-dependent complexity is required.
Near-optimal distributed triangle enumeration via expander decompositions.Journal of the ACM (JACM), 68(3):1–36
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition
Randomized LOCAL-model algorithms achieve 2+ε-approximate maximum matching and approximate minimum vertex cover in O(log n / log² log n) rounds via a generalized graph decomposition, establishing that n-dependent complexity is required.