"Sublinear Time Algorithms and Complexity of Approximate Maximum Matching."

Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein (2022)

Details and statistics

DOI: 10.48550/ARXIV.2211.15843

access: open

type: Informal or Other Publication

metadata version: 2022-12-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics