## Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem (1997)

Venue: | ACM Jounal of Experimental Algorithmics |

Citations: | 19 - 2 self |

### BibTeX

@ARTICLE{Frigioni97experimentalanalysis,

author = {Daniele Frigioni and Mario Ioffreda and Umberto Nanni and Giulio Pasqualone},

title = {Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem},

journal = {ACM Jounal of Experimental Algorithmics},

year = {1997},

volume = {3},

pages = {5}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper we propose the first experimental study of the fully dynamic single source shortest paths problem on directed graphs with positive real edge weights. In particular, we perform an experimental analysis of three different algorithms: Dijkstra's algorithm, and the two output bounded algorithms proposed by Ramalingam and Reps in [31] and by Frigioni, Marchetti-Spaccamela and Nanni in [18], respectively. The main goal of this paper is to provide a first experimental evidence for: (a) the effectiveness of dynamic algorithms for shortest paths with respect to a traditional static approach to this problem; (b) the validity of the theoretical model of output boundedness to analyze dynamic graph algorithms. Beside random generated graphs, useful to capture the "asymptotic" behavior of algorithms, we also develope experiments by considering a widely used graph from the real world, i.e., the Internet graph. Work partially supported by the ESPRIT Long Term Research Project...