On the query complexity of connectivity with global queries
Arinta Auza,
Troy Lee
Abstract: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.Here, for an n-vertex graph with adjacency matrix A, one can query a vector x ∈ {0, 1} n and receive the answer Ax. We give a randomized algorithm that can output a spanning forest of a weighted graph with constant probability after O(log 4 (n)) matrix-vector multiplication queries to the adjacency matrix. This complements a result … Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.