2 citations · 3 across the 3 of their papers we have counts for
1 paper · 1 filter
Arinta Auza, Troy Lee
We study the query complexity of determining if a graph is connected with global queries. The first model we look at is matrix-vector multiplication queries to the adjacency matrix…