Space-Efficient Fault-Tolerant Diameter Oracles

07/07/2021
by   Davide Bilò, et al.
0

We design f-edge fault-tolerant diameter oracles (f-FDOs). We preprocess a given graph G on n vertices and m edges, and a positive integer f, to construct a data structure that, when queried with a set F of |F| ≤ f edges, returns the diameter of G-F. For a single failure (f=1) in an unweighted directed graph of diameter D, there exists an approximate FDO by Henzinger et al. [ITCS 2017] with stretch (1+ε), constant query time, space O(m), and a combinatorial preprocessing time of O(mn + n^1.5√(Dm/ε)).We present an FDO for directed graphs with the same stretch, query time, and space. It has a preprocessing time of O(mn + n^2/ε). The preprocessing time nearly matches a conditional lower bound for combinatorial algorithms, also by Henzinger et al. With fast matrix multiplication, we achieve a preprocessing time of O(n^2.5794 + n^2/ε). We further prove an information-theoretic lower bound showing that any FDO with stretch better than 3/2 requires Ω(m) bits of space. For multiple failures (f>1) in undirected graphs with non-negative edge weights, we give an f-FDO with stretch (f+2), query time O(f^2log^2n), O(fn) space, and preprocessing time O(fm). We complement this with a lower bound excluding any finite stretch in o(fn) space. We show that for unweighted graphs with polylogarithmic diameter and up to f = o(log n/ loglog n) failures, one can swap approximation for query time and space. We present an exact combinatorial f-FDO with preprocessing time mn^1+o(1), query time n^o(1), and space n^2+o(1). When using fast matrix multiplication instead, the preprocessing time can be improved to n^ω+o(1), where ω < 2.373 is the matrix multiplication exponent.

READ FULL TEXT

page 1

page 3

page 5

page 7

page 9

page 11

page 13

page 15

research
05/05/2023

Fault-Tolerant ST-Diameter Oracles

We study the problem of estimating the ST-diameter of a graph that is su...
research
07/06/2021

Space Efficient Two-Dimensional Orthogonal Colored Range Counting

In the two-dimensional orthogonal colored range counting problem, we pre...
research
05/19/2023

Approximate Distance Sensitivity Oracles in Subquadratic Space

An f-edge fault-tolerant distance sensitive oracle (f-DSO) with stretch ...
research
04/22/2022

Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances

We construct data structures for extremal and pairwise distances in dire...
research
06/14/2018

Bounds and algorithms for k-truss

A k-truss is a relaxation of a k-clique developed by Cohen (2005), speci...
research
09/15/2022

Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failures

This paper considers a natural fault-tolerant shortest paths problem: fo...
research
05/02/2023

Connectivity Queries under Vertex Failures: Not Optimal, but Practical

We revisit once more the problem of designing an oracle for answering co...

Please sign up or login with your details

Forgot password? Click here to reset