# Graph Reconstruction via Distance Oracles

arXiv: https://arxiv.org/abs/1304.6588 · HTML: https://mlsanity.com/paper/1304.6588/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Apr 2013.

## Built on by (most cited first, 3 of 3)

- [Tight query complexity bounds for learning graph partitions](https://mlsanity.com/paper/2112.07897/) (2021)
- [Toward a Graph Foundation Model: Pre-Training Transformers With Random Walks](https://mlsanity.com/paper/2506.14098/) (2025)
- [Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs](https://mlsanity.com/paper/2506.08405/) (2025)

## Abstract (arXiv)

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 tildeO(n3/2); reconstruction of a degree bounded outerplanar graph with query complexity tildeO(n); and near-optimal approximate reconstruction of a general graph.