Article

Graph reconstruction via distance oracles

Authors:

Claire Mathieu,

Hang ZhouAuthors Info & Claims

ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Pages 733 - 744

https://doi.org/10.1007/978-3-642-39206-1_62

Published: 08 July 2013 Publication History

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 $\tilde{O}(n^{3/2})$; reconstruction of a degree bounded outerplanar graph with query complexity $\tilde{O}(n)$; and near-optimal approximate reconstruction of a general graph.

References

[1]

Amenta, N., Bern, M., Eppstein, D.: The crust and the beta-skeleton: Combinatorial curve reconstruction. In: Graphical Models and Image Processing, pp. 125-135 (1998)

[2]

Anandkumar, A., Hassidim, A., Kelner, J. A.: Topology discovery of sparse random graphs with few participants. In: SIGMETRICS, pp. 293-304. ACM (2011)

[3]

Angluin, D., Chen, J.: Learning a hidden graph using O(log n) queries per edge. In: Shawe-Taylor, J., Singer, Y. (eds.) COLT 2004. LNCS (LNAI), vol. 3120, pp. 210-223. Springer, Heidelberg (2004)

[4]

Beerliova, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffmann, M., Mihalák, M., Ram, L. S.: Network discovery and verification. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 127-138. Springer, Heidelberg (2005)

[5]

Bouvel, M., Grebinski, V., Kucherov, G.: Combinatorial search on graphs motivated by bioinformatics applications: A brief survey. In:Kratsch, D. (ed.)WG2005. LNCS, vol. 3787, pp. 16-27. Springer, Heidelberg (2005)

[6]

Castro, R., Coates, M., Liang, G., Nowak, R., Yu, B.: Network tomography: recent developments. Statistical Science 19, 499-517 (2004)

[7]

Chartrand, G., Harary, F.: Planar permutation graphs. Annales de l'institut Henri Poincaré (B) Probabilités et Statistiques 3(4), 433-438 (1967)

[8]

Chen, D., Guibas, L. J., Hershberger, J., Sun, J.: Road network reconstruction for organizing paths. In: SODA, pp. 1309-1320 (2010)

[9]

Choi, S.-S., Kim, J. H.: Optimal query complexity bounds for finding graphs. In: STOC, pp. 749-758. ACM (2008)

[10]

Dall'Asta, L., Alvarez-Hamelin, I., Barrat, A., Vázquez, A., Vespignani, A.: Exploring networks with traceroute-like probes: Theory and simulations. Theoretical Computer Science 355(1), 6-24 (2006)

[11]

Dey, T. K., Wenger, R.: Reconstructing curves with sharp corners. Comput. Geom. Theory and Appl. 19, 89-99 (2000)

[12]

Erlebach, T., Hall, A., Hoffmann, M., Mihalák, M.: Network discovery and verification with distance queries. In: Calamoneri, T., Finocchi, I., Italiano, G. F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 69-80. Springer, Heidelberg (2006)

[13]

Grebinski, V., Kucherov, G.: Optimal reconstruction of graphs under the additive model. Algorithmica 28(1), 104-124 (2000)

[14]

Hein, J. J.: An optimal algorithm to reconstruct trees from additive distance data. Bulletin of Mathematical Biology 51(5), 597-603 (1989)

[15]

Honiden, S., Houle, M. E., Sommer, C.: Balancing graph voronoi diagrams. In: ISVD, pp. 183-191. IEEE (2009)

[16]

King, V., Zhang, L., Zhou, Y.: On the complexity of distance-based evolutionary tree reconstruction. In: SODA, pp. 444-453. SIAM (2003)

[17]

Mazzawi, H.: Optimally reconstructing weighted graphs using queries. In: SODA, pp. 608-615. SIAM (2010)

[18]

Reyzin, L., Srivastava, N.: Learning and verifying graphs using queries with a focus on edge counting. In: Hutter, M., Servedio, R. A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol. 4754, pp. 285-297. Springer, Heidelberg (2007)

[19]

Reyzin, L., Srivastava, N.: On the longest path algorithm for reconstructing trees from distance matrices. Information Processing Letters 101(3), 98-100 (2007)

[20]

Tarissan, F., Latapy, M., Prieur, C.: Efficient measurement of complex networks using link queries. In: INFOCOM Workshops, pp. 254-259. IEEE (2009)

[21]

Thorup, M., Zwick, U.: Compact routing schemes. In: SPAA, pp. 1-10. ACM (2001)

[22]

Waterman, M. S., Smith, T. F., Singh, M., Beyer, W.: Additive evolutionary trees. Journal of Theoretical Biology 64(2), 199-213 (1977)

Cited By

Bodwin GChan T(2019)On the structure of unique shortest paths in graphsProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310560(2071-2089)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310560
Kannan SMathieu CZhou H(2018)Graph Reconstruction and VerificationACM Transactions on Algorithms10.1145/319960614:4(1-30)Online publication date: 9-Aug-2018
https://dl.acm.org/doi/10.1145/3199606

Index Terms

Graph reconstruction via distance oracles
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
2. Theory of computation
  1. Design and analysis of algorithms
  2. Randomness, geometry and discrete structures

Index terms have been assigned to the content through auto-classification.

Recommendations

Approximate distance oracles subject to multiple vertex failures
SODA '21: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms

Given an undirected graph G = (V, E) of n vertices and m edges with weights in [1, W], we construct vertex sensitive distance oracles (VSDO), which are data structures that preprocess the graph, and answer the following kind of queries: Given a source ...
Approximate distance oracles with improved query time
SODA '13: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms

Given an undirected graph G with m edges, n vertices, and non-negative edge weights, and given an integer k ≥ 2, we show that a (2k − 1)-approximate distance oracle for G of size O(kn^1+1/k) and with O(log k) query time can be constructed in O(min{kmn^1/k,...
Exact distance oracles for planar graphs
SODA '12: Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms

We present new and improved data structures that answer exact node-to-node distance queries in planar graphs. Such data structures are also known as distance oracles. For any directed planar graph on n nodes with non-negative lengths we obtain the ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

July 2013

850 pages

ISBN:9783642392054

Editors:
Fedor V. Fomin
Department of Informatics, University of Bergen, Bergen, Norway
,
Rūsiņš Freivalds
Faculty of Computing, University of Latvia, Raina bulv. 19, Riga, Latvia
,
Marta Kwiatkowska
Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, Oxford, UK
,
David Peleg
Faculty of Mathematics and Computer Science, Weizmann Institute of Science, Wolfson Building, Parks Road, Rehovot, Israel

Sponsors

QuBalt: QuBalt
University of Latvia: University of Latvia

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 08 July 2013

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bodwin GChan T(2019)On the structure of unique shortest paths in graphsProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310560(2071-2089)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310560
Kannan SMathieu CZhou H(2018)Graph Reconstruction and VerificationACM Transactions on Algorithms10.1145/319960614:4(1-30)Online publication date: 9-Aug-2018
https://dl.acm.org/doi/10.1145/3199606

View Options

View options

Media

Figures

Other

Tables

View Table of Contents