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

Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein (2023)

Details and statistics

DOI: 10.1145/3564246.3585231

access: closed

type: Conference or Workshop Paper

metadata version: 2023-05-22

a service of  Schloss Dagstuhl - Leibniz Center for Informatics