Graph Reconstruction via Distance Oracles
Abstract
We study the problem of reconstructing a hidden graph given access to a distance oracle. We design randomized algorithms for the following problems: reconstruction of a degree bounded graph with query complexity O(n3/2); reconstruction of a degree bounded outerplanar graph with query complexity O(n); and near-optimal approximate reconstruction of a general graph.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.