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.
For example, Demetrescu and Italiano REF suggest an efficient algorithm for maintaining all-pairs-shortest-paths in directed graphs.
Experimental analysis of dynamic all pairs shortest path algorithms
TALG
Mathematics Computer Science