# Space-Efficient Fault-Tolerant Diameter Oracles

@article{Bil2021SpaceEfficientFD,
title={Space-Efficient Fault-Tolerant Diameter Oracles},
author={Davide Bil{\o} and Sarel Cohen and Tobias Friedrich and Martin Schirneck},
journal={ArXiv},
year={2021},
volume={abs/2107.03485}
}`
• Published 7 July 2021
• Computer Science, Mathematics
• ArXiv
We design f-edge fault-tolerant diameter oracles (f -FDO, or simply FDO if f = 1). For a given directed or undirected and possibly edge-weighted graph G with n vertices and m edges and a positive integer f , we preprocess the graph and construct a data structure that, when queried with a set F of edges, where |F | ⩽ f , returns the diameter of G − F . An f -FDO has stretch σ ⩾ 1 if the returned value D̂ satisfies diam(G − F ) ⩽ D̂ ⩽ σ diam(G − F ). For the case of a single edge failure (f = 1…

## References

SHOWING 1-10 OF 45 REFERENCES

### (1 + ∊)-Approximate f-Sensitive Distance Oracles

• Mathematics, Computer Science
SODA
• 2017
To the best of the knowledge, this work gives the first nontrivial f-sensitive distance oracle with fast query time and small stretch capable of handling multiple edge failures.

### Constructing a Distance Sensitivity Oracle in O(n2.5794M) Time

• Computer Science
ICALP
• 2021
The main technical ingredient is an algorithm that computes the inverse of a degree-d polynomial matrix modulo x, which improves the O(n2.6865M) time bound in [Ren, ESA 2020], and matches the current best time bound for computing all-pairs shortest paths.

### A nearly optimal oracle for avoiding failed vertices and edges

• Computer Science, Mathematics
STOC '09
• 2009
An improved oracle for the distance sensitivity problem that has an improved construction time of ~O(mn), and it is deterministic, barring improved solutions to the all pairs shortest path problem, is optimal up to logarithmic factors.

### Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees

• Computer Science
STACS
• 2016
The problem of designing a sparse f -edge-fault-tolerant ( f -EFT) σ -approximate single-source shortest-path tree (ASPT) is studied, namely a subgraph of G having as few edges as possible and which contains paths from a fixed source that are stretched by a factor of at most σ .

### Distance sensitivity oracles with subcubic preprocessing time and fast query time

• Computer Science
STOC
• 2020
This paper affirmatively presents the first distance sensitivity oracle with subcubic preprocessing time and poly-logarithmic query time for directed graphs with integer weights in the range [−M,M] and presents a distance sensitive oracle supporting a single vertex/edge failure in subcUBic Õ(Mn 2.873) query time.

### Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time

This work considers the problem of building Distance Sensitivity Oracles (DSOs), and constructs a DSO with preprocessing time $P+\tilde{O}(n^2)\cdot Q$ and query time $O(1)$.

### Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms

• Computer Science, Mathematics
SODA
• 2020
This work shows the existence of (and algorithms to compute) various t -diameter spanners with a sparse set of edges and t ă 2, for directed graphs, and obtains the first r O p m q -time algorithm for computing 2-approximation of vertex eccentricities in general directed graphs.

### Oracles for Distances Avoiding a Failed Node or Link

• Computer Science
SIAM J. Comput.
• 2008
A deterministic oracle with constant query time for this problem that uses $O (n^2\log n)$ space, where $n$ is the number of vertices in $G$ and the construction time for the oracle is $O(mn^{2} + n^{3}\ log n)$.

### Better Approximation Algorithms for the Graph Diameter

• Computer Science
SODA
• 2014
Two algorithms are deterministic, and thus the first deterministic (2 -- e)-approximation algorithm for the diameter that takes subquadratic time in sparse graphs is presented.

### Improved Distance Sensitivity Oracles via Tree Partitioning

• Computer Science