Sublinear Time Algorithms and Complexity of Approximate Maximum Matching.

Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein

Browse the full STOC paper archive.