An algorithm estimates a graph's maximum matching size within factor 0.5109 in O~(n sqrt(n)) time, the first fixed constant above 0.5 in strongly sublinear time.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time
An algorithm estimates a graph's maximum matching size within factor 0.5109 in O~(n sqrt(n)) time, the first fixed constant above 0.5 in strongly sublinear time.