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.
Demetrescu, C., Italiano, G.f. (2006). Experimental analysis of dynamic all pairs shortest path algorithms. ACM TRANSACTIONS ON ALGORITHMS, 2(4), 578-601 [http://doi.acm.org/10.1145/1198513.1198519].
Experimental analysis of dynamic all pairs shortest path algorithms
ITALIANO, GIUSEPPE FRANCESCO
2006-01-01
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
