In the Graph Reconstruction (GR) problem, the goal is to recover a hidden graph by utilizing some oracle that provides limited access to the structure of the graph. The interest is in characterizing how strong different oracles are when the complexity of an algorithm is measured in the number of performed queries. We study a novel oracle that returns the set of connected components (CC) on the subgraph induced by the queried subset of vertices. Our main contributions are as follows: 1. For a hidden graph with n vertices, m edges, maximum degree Δ, and treewidth k, GR can be solved in O (\m / m, Δ², k²\ n) CC queries by an adaptive randomized algorithm. 2. For a hidden graph with n vertices and degeneracy d, GR can be solved in O (d² ² n) CC queries by an adaptive randomized algorithm. 3. For a hidden graph with n vertices, m edges, maximum degree Δ, and treewidth k, no algorithm can solve GR in o (\m, Δ², k²\) CC queries.
Harviainen et al. (Fri,) studied this question.