An f-edge fault-tolerant distance sensitive oracle (f-DSO) with stretch σ≥ 1 is a data structure
that preprocesses a given undirected, unweighted graph G with n vertices and m edges, and …

Algebraic techniques have had an important impact on graph algorithms so far. Porting
them, eg, the matrix inverse, into the dynamic regime improved best-known bounds for …

An f-edge fault-tolerant distance sensitive oracle (f-DSO) with stretch σ⩾ 1 is a data structure
that preprocesses an input graph G. When queried with the triple (s, t, F), where s, t∈ V and …

We design sensitivity oracles for error-prone networks. For a network problem $\Pi $, the
data structure preprocesses a network $ G=(V, E) $ and sensitivity parameter $ f $ such that …

We study the problem of estimating the $ ST $-diameter of a graph that is subject to a
bounded number of edge failures. An $ f $-edge fault-tolerant $ ST $-diameter oracle ($ f …

Compact Distance Oracles with Large Page 160 2 Compact Distance Oracles with Large
Sensitivity and Low Stretch Davide Bilò¹, Keerti Choudhary², Sarel Cohen³, Tobias Friedrich4 …