New Results on Linear Size Distance Preservers
Greg Bodwin · SIAM Journal on Computing · 2021
Given $p$ node pairs in an $n$-node graph, a distance preserver is a sparse subgraph that agrees with the original graph on all of the given pairwise distances. We prove the following bounds on the number of edges needed for a distance preserver: 1. Any $p$ node pairs in a directed weighted graph have a distance preserver on $O(n + n^{2/3} p)$ edges. 2. Any $p = \Omega(\frac{n^2}{{\tt RS}(n)})$ node pairs in an undirected unweighted graph have a distance preserver on $O(p)$ edges, where ${\tt RS}(n)$ is the Ruzsa--Szemerédi function from combinatorial graph theory. 3. As a lower bound, there are examples where one needs $\omega(\sigma^2)$ edges to preserve all pairwise distances within a subset of $\sigma = o(n^{2/3})$ nodes in an undirected weighted graph. If we additionally require that the graph is unweighted, then the range of this lower bound falls slightly to $\sigma \le n^{2/3 - o(1)}$.