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 Õ(n); reconstruction of a degree bounded outerplanar graph with query complexity Õ(n); and near-optimal approximate reconstruction of a general… (More)
DOI: 10.1007/978-3-642-39206-1_62
View Slides

5 Figures and Tables

Topics

  • Presentations referencing similar topics