Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study

Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni. Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. In Stefan Näher, Dorothea Wagner, editors, Algorithm Engineering, 4th International Workshop, WAE 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings. Volume 1982 of Lecture Notes in Computer Science, pages 218-229, Springer, 2000. [doi]

Abstract

Abstract is missing.