
The minimum number of maximal independent set queries required to reconstruct the edges of a hidden graph with n vertices and maximum degree Δ is Ω(Δ^2 log(n/Δ)) for randomized non-adaptive algorithms and Ω(Δ^3 log n / log Δ) for deterministic non-adaptive algorithms.


coremsg

lower-bounds-for-graph-reconstruction-using-maximal-independent-set-queries


Lower Bounds for Graph Reconstruction Using Maximal Independent Set Queries
