2 citations · 5 across the 16 of their papers we have counts for
1 paper · 2 filters
Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani +1
How many adjacency matrix queries (also known as pair queries) are required to estimate the size of a maximum matching in an n-vertex graph G? We study this fundamental questio…