Time-Optimal Sublinear Algorithms for Matching and Vertex Cover

Soheil Behnezhad. Time-Optimal Sublinear Algorithms for Matching and Vertex Cover. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022. pages 873-884, IEEE, 2021. [doi]

Abstract

Abstract is missing.