A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Fully dynamic all pairs shortest paths with real edge weights
2006
Journal of computer and system sciences (Print)
We present the first fully dynamic algorithm for maintaining all pairs shortest paths in directed graphs with real-valued edge weights. Given a dynamic directed graph G such that each edge can assume at most S different real values, we show how to support updates in O(n 2.5 S log 3 n ) amortized time and queries in optimal worst-case time. No previous fully dynamic algorithm was known for this problem. In the special case where edge weights can only be increased, we give a randomized algorithm
doi:10.1016/j.jcss.2005.05.005
fatcat:uf2gpex2hrhcpirotvyypnejbm