A New Algorithm for Decremental Single-Source Shortest Paths with Applications to Vertex-Capacitated Flow and Cut Problems

We study the vertex decremental Single-Source Shortest Paths (SSSP) problem: given an undirected graph G = (V, E) with lengths l(e) >= 1 on its edges that undergoes vertex deletions, and a source vertex s, we need to support (approximate) shortest-path queries in G: given a vertex v, return a path connecting s to v, whose length is at most (1 + epsilon) times the length of the shortest such path, where. is a given accuracy parameter. The problem has many applications, for example to flow and cut problems in vertex-capacitated graphs. Decremental SSSP is a fundamental problem in dynamic algorithms that has been studied extensively, especially in the more standard edge-decremental setting, where the input graph G undergoes edge deletions. The classical algorithm of Even and Shiloach supports exact shortest-path queries in O(mn) total update time. A series of recent results have improved this bound to O(m(1+o(1)) log L), where L is the largest length of any edge. However, these improved results are randomized algorithms that assume an oblivious adversary. To go beyond the oblivious adversary restriction, recently, Bernstein, and Bernstein and Chechik designed deterministic algorithms for the problem, with total update time (O) over tilde (n(2) log L), that by definition work against an adaptive adversary. Unfortunately, their algorithms introduce a new limitation, namely, they can only return the approximate length of a shortest path, and not the path itself. Many applications of the decremental SSSP problem, including the ones considered in this paper, crucially require both that the algorithm returns the approximate shortest paths themselves and not just their lengths, and that it works against an adaptive adversary. Our main result is a randomized algorithm for vertex decremental SSSP with total expected update time O(n(2+o(1)) log L), that responds to each shortest-path query in (O) over tilde (n log L) time in expectation, returning a (1 + epsilon)-approximate shortest path. The algorithm works against an adaptive adversary. The main technical ingredient of our algorithm is an (O) over tilde (vertical bar E(G)vertical bar + n(1+o(1)))-time algorithm to compute a core decomposition of a given dense graph G, which allows us to compute short paths between pairs of query vertices in G efficiently. We use our result for vertex-decremental SSSP to obtain (1 + epsilon)-approximation algorithms for maximum s-t flow and minimum s-t cut in vertex-capacitated graphs, in expected time n(2+o(1)), and an O (log(4) n)-approximation algorithm for the vertex version of the sparsest cut problem with expected running time n(2+o(1)). These results improve upon the previous best known algorithms for these problems in the regime where m = omega(n(1.5+o(1))).