Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Oracles for distances avoiding a link-failure
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Improved Distance Oracles for Avoiding Link-Failure
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
A new approach to dynamic all pairs shortest paths
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
Experimental analysis of dynamic all pairs shortest path algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A new approach to dynamic all pairs shortest paths
Journal of the ACM (JACM)
An Efficient Dynamic Algorithm for Maintaining All-Pairs Shortest Paths in Stochastic Networks
IEEE Transactions on Computers
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences - Special issue on FOCS 2001
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Subquadratic algorithm for dynamic shortest distances
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
k-Centralities: local approximations of global measures based on shortest paths
Proceedings of the 21st international conference companion on World Wide Web
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
| Hi-index | 0.00 |
We present the first fully dynamic algorithm for maintaining all pairs shortest paths in directed graphs with realvalued 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 deterministicallyin 0(S \cdot n^{2.5} \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 with one-sided error which supports updates faster in 0(S \cdot n\log ^3 n) amortized time.