# Quasi-linear distance query reconstruction for graphs of bounded treelength

arXiv: https://arxiv.org/abs/2410.12594 · HTML: https://mlsanity.com/paper/2410.12594/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 16 Oct 2024.

## Built on by (most cited first, 1 of 1)

- [Graph Inference with Effective Resistance Queries](https://mlsanity.com/paper/2502.18350/) (2025)

## Abstract (arXiv)

In distance query reconstruction, we wish to reconstruct the edge set of a hidden graph by asking as few distance queries as possible to an oracle. Given two vertices u and v, the oracle returns the shortest path distance between u and v in the graph. The length of a tree decomposition is the maximum distance between two vertices contained in the same bag. The treelength of a graph is defined as the minimum length of a tree decomposition of this graph. We present an algorithm to reconstruct an n-vertex connected graph G parameterized by maximum degree Delta and treelength k in Ok,Delta(n log2 n) queries (in expectation). This is the first algorithm to achieve quasi-linear complexity for this class of graphs. The proof goes through a new lemma that could give independent insight on graphs of bounded treelength.