A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Fully Dynamic All Pairs All Shortest Paths
[article]
2022
arXiv
pre-print
We consider the all pairs all shortest paths (APASP) problem, which maintains all of the multiple shortest paths for every vertex pair in a directed graph G=(V,E) with a positive real weight on each edge. We present two fully dynamic algorithms for this problem in which an update supports either weight increases or weight decreases on a subset of edges incident to a vertex. Our first algorithm runs in amortized O(ν^*^2 ·log^3 n) time per update, where n = |V|, and ν^* bounds the number of edges
arXiv:1412.3852v4
fatcat:7eget5wtrbeqbmm2yzwf4ckkea