Quasi-linear distance query reconstruction for graphs of bounded treelength

TL;DR

This paper introduces a quasi-linear algorithm for reconstructing graphs with bounded treelength using distance queries, significantly improving efficiency for this class of graphs.

Contribution

It presents the first quasi-linear time algorithm for graph reconstruction based on treelength and maximum degree, with new theoretical insights into graphs of bounded treelength.

Findings

Achieves $O_{k, riangle}(n \, ext{log}^2 n)$ query complexity

First algorithm with quasi-linear complexity for graphs of bounded treelength

Provides a new lemma offering insights into graphs with bounded treelength

Abstract

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 $O_{k,\Delta}(n \log^2 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.