Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Finding the hidden path: time bounds for all-pairs shortest paths
SIAM Journal on Computing
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
An incremental algorithm for a generalization of the shortest-path problem
Journal of Algorithms
An empirical study of dynamic graph algorithms
Journal of Experimental Algorithmics (JEA)
Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
Experimental analysis of dynamic minimum spanning tree algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
An On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
New dynamic SPT algorithm based on a ball-and-string model
IEEE/ACM Transactions on Networking (TON)
Bounded Incremental Computation
Bounded Incremental Computation
Mathematics for the Analysis of Algorithms
Mathematics for the Analysis of Algorithms
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Transportation Science
A new approach to dynamic all pairs shortest paths
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A new approach to dynamic all pairs shortest paths
Journal of the ACM (JACM)
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Does path cleaning help in dynamic all-pairs shortest paths?
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Adaptive fastest path computation on a road network: a traffic mining approach
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
An experimental study of algorithms for fully dynamic transitive closure
Journal of Experimental Algorithmics (JEA)
Efficient best path monitoring in road networks for instant local traffic information
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
f-sensitivity distance Oracles and routing schemes
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
An experimental study of algorithms for fully dynamic transitive closure
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Type-directed automatic incrementalization
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
The weighted shortest path search based on multi-agents in mobile GIS management services
Wireless Communications & Mobile Computing
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
We present the results of an extensive computational study on dynamic algorithms for all pairs shortest path problems. We describe our implementations of the recent dynamic algorithms of King [18] and of Demetrescu and Italiano [7], and compare them to the dynamic algorithm of Ramalingam and Reps [25] and to static algorithms on random, real-world and hard instances. Our experimental data suggest that some of the dynamic algorithms and their algorithmic techniques can be really of practical value in many situations.