Semi-dynamic shortest-path tree algorithms for directed graphs with arbitrary weights

Given a directed graph $G$ with arbitrary real-valued weights, the single source shortest-path problem (SSSP) asks for, given a source $s$ in $G$, finding a shortest path from $s$ to each vertex $v$ in $G$. A classical SSSP algorithm detects a negative cycle of $G$ or constructs a shortest-path tree (SPT) rooted at $s$ in $O(mn)$ time, where $m,n$ are the numbers of edges and vertices in $G$ respectively. In many practical applications, new constraints come from time to time and we need to update the SPT frequently. Given an SPT $T$ of $G$, suppose the weight on a certain edge is modified. We show by rigorous proof that the well-known {\sf Ball-String} algorithm for positively weighted graphs can be adapted to solve the dynamic SPT problem for directed graphs with arbitrary weights. Let $n_0$ be the number of vertices that are affected (i.e., vertices that have different distances from $s$ or different parents in the input and output SPTs) and $m_0$ the number of edges incident to an affected vertex. The adapted algorithms terminate in $O(m_0+n_0 \log n_0)$ time, either detecting a negative cycle (only in the decremental case) or constructing a new SPT $T'$ for the updated graph. We show by an example that the output SPT $T'$ may have more than necessary edge changes to $T$. To remedy this, we give a general method for transforming $T'$ into an SPT with minimal edge changes in time $O(n_0)$ provided that $G$ has no cycles with zero length.

[1]  Daniele Frigioni,et al.  Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study , 2000, WAE.

[2]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[3]  Kai-Yeung Siu,et al.  New dynamic algorithms for shortest path tree computation , 2000, TNET.

[4]  Daniele Frigioni,et al.  Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs , 1997, STACS.

[5]  Kai-Yeung Siu,et al.  New dynamic SPT algorithm based on a ball-and-string model , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[6]  Suneeta Agarwal,et al.  Maintaining Shortest Path Tree in Dynamic Digraphs Having Negative Edge-Weights , 2011 .

[7]  A. Pan,et al.  On Finding and Updating Spanning Trees and Shortest Paths , 1975, SIAM J. Comput..

[8]  Edward P. F. Chan,et al.  Shortest Path Tree Computation in Dynamic Graphs , 2009, IEEE Transactions on Computers.

[9]  Shiri Chechik,et al.  Deterministic decremental single source shortest paths: beyond the o(mn) bound , 2016, STOC.

[10]  Daniele Frigioni,et al.  Fully dynamic output bounded single source shortest path problem , 1996, SODA '96.

[11]  Jae Hee Lee,et al.  Multiagent Simple Temporal Problem: The Arc-Consistency Approach , 2017, AAAI.

[12]  Robert E. Tarjan,et al.  Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation , 1988, CACM.

[13]  Daniele Frigioni,et al.  Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights , 1998, ESA.

[14]  Thomas W. Reps,et al.  On the Computational Complexity of Dynamic Graph Problems , 1996, Theor. Comput. Sci..

[15]  Daniele Frigioni,et al.  Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees , 1998, Algorithmica.

[16]  Shimon Even,et al.  An On-Line Edge-Deletion Problem , 1981, JACM.

[17]  Eric C. Rosen,et al.  An overview of the new routing algorithm for the ARPANET , 1979, SIGCOMM '79.

[18]  Jiannong Cao,et al.  An efficient algorithm for dynamic shortest path tree update in network routing , 2007, Journal of Communications and Networks.

[19]  Daniele Frigioni,et al.  Incremental Algorithms for the Single-Source Shortest Path Problem , 1994, FSTTCS.

[20]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[21]  Uri Zwick,et al.  On Dynamic Shortest Paths Problems , 2004, Algorithmica.

[22]  Mikkel Thorup,et al.  Speeding Up Dynamic Shortest-Path Algorithms , 2008, INFORMS J. Comput..

[23]  G. Ramalingam.  Bounded Incremental Computation , 1996, Lecture Notes in Computer Science.

[24]  Daniel Aioanei,et al.  Lazy Shortest Path Computation in Dynamic graphs , 2012, Comput. Sci..

[25]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[26]  Mathijs de Weerdt,et al.  Computing All-Pairs Shortest Paths by Leveraging Low Treewidth , 2011, ICAPS.

[27]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[28]  Daniele Frigioni,et al.  Fully Dynamic Algorithms for Maintaining Shortest Paths Trees , 2000, J. Algorithms.

[29]  Daniele Frigioni,et al.  Fully dynamic shortest paths in digraphs with arbitrary arc weights , 2003, J. Algorithms.

[30]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .