Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

Vertex-Failure Distance Oracles and Labeling Schemes: Compact and Constant-Approximate

Published 1 Oct 2026 in cs.DS | (2610.02016v1)

Abstract: We present new algorithms for the vertex-failure distance oracles and labeling schemes problems in undirected weighted graphs. A vertex-failure distance oracle is a data structure that, given two vertices xx and yy and a failed vertex set FF of size at most ff, returns an approximation to the distance between xx and yy in G∖FG \setminus F. In the labeling-scheme setting, the data structure needs to be stored distributively as labels on the vertices, and each query (x,y,F)(x,y,F) must be answered by accessing only the labels of the vertices in F∪{x,y}F \cup \{x,y\}. For any f≥1f\geq 1 and k≥1k \ge 1, we obtain a vertex-failure distance oracle with O(k6)O(k^{6}) approximation, space O~(f2n1+1/k)\tilde{O}(f^{2}n^{1+1/k}), query time O~(f5n1/k)\tilde{O}(f^{5}n^{1/k}), and polynomial preprocessing time. In particular, this is the first time-efficient oracle for multiple vertex failures with space close to linear, as well as the first constant-approximation oracle with polynomial space when tolerating Ω(log⁡n)Ω(\log n) vertex failures. The previous results, due to [Duan-Gu-Ren, SODA'21], gave two alternatives: for any constant c≥1c \ge 1 and ε>0ε>0, one oracle has poly(log⁡n,f)\mathrm{poly}(\log n,f) approximation, space n2+1/cpoly(log⁡n,f)n^{2+1/c}\mathrm{poly}(\log n,f), and query time poly(log⁡n,fc)\mathrm{poly}(\log n,f^{c}), while the other has (1+ε)(1+ε) approximation, space n2+1/c(log⁡n/ε)O(f)n^{2+1/c}(\log n/ε)^{O(f)}, and query time poly(log⁡n,fc,1/ε)\mathrm{poly}(\log n,f^{c},1/ε). We also obtain a vertex-failure distance labeling scheme with O(k6)O(k^{6}) approximation and label size f3n1/klog⁡O(k)nf^{3}n^{1/k}\log^{O(k)} n. This is the first nontrivial distance labeling scheme for vertex failures. Our techniques build on recent tools related to length-constrained vertex expanders and also introduce a new expander-based shortcut sparsification. The latter also leads to a deterministic vertex-failure connectivity labeling scheme of size O~(f2)\tilde{O}(f^{2}).

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.