A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Space-Efficient Fault-Tolerant Diameter Oracles
[article]

2021
*
arXiv
*
pre-print

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 +

arXiv:2107.03485v1
fatcat:3a2l7rvbifdyzjiu4q23fhf7uu