Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs

Published 29 Apr 2015 in cs.DS | (1504.07959v2)

Abstract: We consider dynamic algorithms for maintaining Single-Source Reachability (SSR) and approximate Single-Source Shortest Paths (SSSP) on nn-node mm-edge directed graphs under edge deletions (decremental algorithms). The previous fastest algorithm for SSR and SSSP goes back three decades to Even and Shiloach [JACM 1981]; it has O(1) O(1) query time and O(mn) O (mn) total update time (i.e., linear amortized update time if all edges are deleted). This algorithm serves as a building block for several other dynamic algorithms. The question whether its total update time can be improved is a major, long standing, open problem. In this paper, we answer this question affirmatively. We obtain a randomized algorithm with an expected total update time of O(min⁡(m7/6n2/3+o(1),m3/4n5/4+o(1)))=O(mn9/10+o(1)) O(\min (m^{7/6} n^{2/3 + o(1)}, m^{3/4} n^{5/4 + o(1)}) ) = O (m n^{9/10 + o(1)}) for SSR and (1+ϵ)(1+\epsilon)-approximate SSSP if the edge weights are integers from $ 1 $ to W≤2log⁡cn W \leq 2^{\log^c{n}} and ϵ≥1/log⁡cn \epsilon \geq 1 / \log^c{n} for some constant c c . We also extend our algorithm to achieve roughly the same running time for Strongly Connected Components (SCC), improving the algorithm of Roditty and Zwick [FOCS 2002]. Our algorithm is most efficient for sparse and dense graphs. When m=Θ(n) m = \Theta(n) its running time is O(n1+5/6+o(1)) O (n^{1 + 5/6 + o(1)}) and when m=Θ(n2) m = \Theta(n^2) its running time is O(n2+3/4+o(1)) O (n^{2 + 3/4 + o(1)}) . For SSR we also obtain an algorithm that is faster for dense graphs and has a total update time of O(m2/3n4/3+o(1)+m3/7n12/7+o(1)) O ( m^{2/3} n^{4/3 + o(1)} + m^{3/7} n^{12/7 + o(1)}) which is O(n2+2/3) O (n^{2 + 2/3}) when m=Θ(n2) m = \Theta(n^2) . All our algorithms have constant query time in the worst case and are correct with high probability against an oblivious adversary.

Citations (64)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.