Does path cleaning help in dynamic all-pairs shortest paths?

  • Authors:

  • C. Demetrescu;P. Faruolo;G. F. Italiano;M. Thorup

  • Affiliations:

  • Dip. di Informatica e Sistemistica, Univ. Roma "La Sapienza", Italy;Dip. di Informatica ed Applicazioni, Univ. Salerno, Italy;Dip. di Informatica, Sistemi e Produzione, Univ. Roma "Tor Vergata", Italy;AT&T Labs-Research, Florham Park, NJ

  • Venue:
  • ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the dynamic all-pairs shortest path problem we wish to maintain information about distances in a weighted graph subject to dynamic operations such as edge insertions, edge deletions, and edge weight updates. The most efficient algorithms for this problem maintain a suitable superset of shortest paths in the graph. This superset retains information about the history of previous graph updates so as to avoid pathological situations where algorithms are continuously forced to rebuild large portions of their data structures. On the other hand, the set of maintained paths may grow too large, resulting in both prohibitive space consumption and inefficient updates. To circumvent this problem, the algorithms perform suitable path cleaning operations. In this paper, we implement and experiment with a recent efficient algorithm by Thorup, which differs from the previous algorithms mainly in the way path cleaning is done, and we carry out a thorough experimental investigation on known implementations of dynamic shortest path algorithms. Our experimental study puts the new results into perspective with respect to previous work and gives evidence that path cleaning, although crucial for the theoretical bounds, appears to be instead of very limited impact in practice.