Graph Reconstruction via Distance Oracles
Data Structures and Algorithms
2013-04-25 v1
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 ; reconstruction of a degree bounded outerplanar graph with query complexity ; and near-optimal approximate reconstruction of a general graph.
Keywords
Cite
@article{arxiv.1304.6588,
title = {Graph Reconstruction via Distance Oracles},
author = {Claire Mathieu and Hang Zhou},
journal= {arXiv preprint arXiv:1304.6588},
year = {2013}
}