A Simple Algorithm for Graph Reconstruction - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2021

A Simple Algorithm for Graph Reconstruction

Résumé

How 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 ̃O(n3/2) distance queries. In our work, we analyze a simple reconstruction algorithm. We show that, on random ∆-regular graphs, our algorithm uses ̃O(n) distance queries. As by-products, we can reconstruct those graphs using O(log2 n) queries to an all-distances oracle or ̃O(n) queries to a betweenness oracle, and we bound the metric dimension of those graphs by log2 n. 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.

Dates et versions

hal-03457033 , version 1 (30-11-2021)

Licence

Paternité

Identifiants

Citer

Claire Mathieu, Hang Zhou. A Simple Algorithm for Graph Reconstruction. 29th Annual European Symposium on Algorithms (ESA 2021), 2021, ⟨10.4230/LIPIcs.ESA.2021.68⟩. ⟨hal-03457033⟩
21 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More