Experimental analysis of dynamic all pairs shortest path algorithms

Authors:
Camil Demetrescu;Giuseppe F. Italiano
Affiliations:
Università di Roma “La Sapienza”, Rome, Italy;Università di Roma “Tor Vergata”, Rome, Italy
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2006

Citing 18
Cited 13

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
A new approach to dynamic all pairs shortest paths

Journal of the ACM (JACM)
Fully dynamic all pairs shortest paths with real edge weights

Journal of Computer and System Sciences - Special issue on FOCS 2001

An experimental study of algorithms for fully dynamic transitive closure

Journal of Experimental Algorithmics (JEA)
Discovering correlated spatio-temporal changes in evolving graphs

Knowledge and Information Systems
From High Girth Graphs to Hard Instances

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Maintaining dynamic minimum spanning trees: An experimental study

Discrete Applied Mathematics
Dynamic graph algorithms

Algorithms and theory of computation handbook
Transparent and scalable terminal mobility for vehicular networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic graph query primitives for SDN-based cloudnetwork management

Proceedings of the first workshop on Hot topics in software defined networks
Pay-as-you-go maintenance of precomputed nearest neighbors in large graphs

Proceedings of the 21st ACM international conference on Information and knowledge management
Incremental algorithm for updating betweenness centrality in dynamically growing networks

Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Incremental closeness centrality for dynamically changing social networks

Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
All-pairs shortest paths in O(n2) time with high probability

Journal of the ACM (JACM)
CrowdRoute: a crowd-sourced routing algorithm in public transit networks

Proceedings of the Second ACM SIGSPATIAL International Workshop on Crowdsourced and Volunteered Geographic Information
Group planning with time constraints

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 [1999] and of Demetrescu and Italiano [2006], and compare them to the dynamic algorithm of Ramalingam and Reps 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.