Affiliation:
1. CNRS Paris France
2. École Polytechnique Palaiseau France
Abstract
AbstractHow efficiently can we find an unknown graph using distance queries between its vertices? We assume that the unknown graph is connected, unweighted, and has bounded degree. The goal is to find every edge in the graph. This problem admits a reconstruction algorithm based on multi‐phase Voronoi‐cell decomposition and using distance queries. In our work, we analyze a simple reconstruction algorithm. We show that, on random ‐regular graphs, our algorithm uses distance queries. As by‐products, with high probability, we can reconstruct those graphs using queries to an all‐distances oracle or queries to a betweenness oracle, and we bound the metric dimension of those graphs by . Our reconstruction algorithm has a very simple structure, and is highly parallelizable. On general graphs of bounded degree, our reconstruction algorithm has subquadratic query complexity.
Subject
Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software
Reference44 articles.
1. M.Abrahamsen G.Bodwin E.Rotenberg andM.Stöckel Graph reconstruction with a betweenness oracle 33rd Symp. Theor. Asp. Comput. Sci. Schloss Dagstuhl–Leibniz‐Zentrum fuer Informatik 2016 pp. 5:1–5:14.
2. On the bias of traceroute sampling
3. R.Afshar M. T.Goodrich P.Matias andM. C.Osegueda Reconstructing biological and digital phylogenetic trees in parallel. 28th Annu. Eur. Symp. Algorithms Schloss Dagstuhl–Leibniz‐Zentrum für Informatik 2020 Vol 173 pp. 3:1–3:24.
4. Topology discovery of sparse random graphs with few participants
5. Base size, metric dimension and other invariants of groups and graphs