Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary

by   Maximilian Probst Gutenberg, et al.

Given a dynamic digraph G = (V,E) undergoing edge deletions and given s∈ V and ϵ>0, we consider the problem of maintaining (1+ϵ)-approximate shortest path distances from s to all vertices in G over the sequence of deletions. Even and Shiloach (J. ACM'81) give a deterministic data structure for the exact version of the problem with total update time O(mn). Henzinger et al. (STOC'14, ICALP'15) give a Monte Carlo data structure for the approximate version with improved total update time O(mn^0.9 + o(1)log W) where W is the ratio between the largest and smallest edge weight. A drawback of their data structure is that they only work against an oblivious adversary, meaning that the sequence of deletions needs to be fixed in advance. This limits its application as a black box inside algorithms. We present the following (1+ϵ)-approximate data structures: (1) the first data structure is Las Vegas and works against an adaptive adversary; it has total expected update time Õ(m^2/3n^4/3) for unweighted graphs and Õ(m^3/4n^5/4log W) for weighted graphs, (2) the second data structure is Las Vegas and assumes an oblivious adversary; it has total expected update time Õ(√(m) n^3/2) for unweighted graphs and Õ(m^2/3n^4/3log W) for weighted graphs, (3) the third data structure is Monte Carlo and is correct w.h.p. against an oblivious adversary; it has total expected update time Õ((mn)^7/8log W) = Õ(mn^3/4log W). Each of our data structures can be queried at any stage of G in constant worst-case time; if the adversary is oblivious, a query can be extended to also report such a path in time proportional to its length. Our update times are faster than those of Henzinger et al. for all graph densities.



There are no comments yet.


page 1

page 2

page 3

page 4


Decremental APSP in Directed Graphs Versus an Adaptive Adversary

Given a directed graph G = (V,E), undergoing an online sequence of edge ...

Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds

Given a directed weighted graph G=(V,E) undergoing vertex insertions and...

Dynamic Geometric Set Cover, Revisited

Geometric set cover is a classical problem in computational geometry, wh...

Fully Dynamic Spectral Vertex Sparsifiers and Applications

We study dynamic algorithms for maintaining spectral vertex sparsifiers ...

Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers

We present a general framework of designing efficient dynamic approximat...

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles

We present a data structure that in a dynamic graph of treedepth at most...

Constant-Time Dynamic Weight Approximation for Minimum Spanning Forest

We give two fully dynamic algorithms that maintain a (1+ε)-approximation...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.