Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1982 LNCS, Issue , 2001, Pages 218-229

  Demetrescu, Camil ^a   Frigioni, Daniele ^a   Marchetti Spaccamela, Alberto ^a   Nanni, Umberto ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; DIRECTED GRAPHS; GRAPH THEORY;

DYNAMIC ALGORITHM; FULLY DYNAMIC ALGORITHMS; NON NEGATIVES; ORDERS OF MAGNITUDE; RE-COMPUTING; SHORTEST PATH; SINGLE SOURCE SHORTEST PATHS; STATIC ALGORITHMS; TEST SETS;

DIRECTED GRAPHS; ALGORITHMS;

EID: 84896782455     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44691-5_19     Document Type: Conference Paper

References (16)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
2. D. Alberts, G. Cattaneo, and G. F. Italiano. An empirical study of dynamic graph algorithms. ACM Journal on Experimental Algorithmics, 2: Article 5, 1997.
3. G. Amato, G. Cattaneo, and G. F. Italiano. Experimental analysis of dynamic minimum spanning tree algorithms. In ACM-SIAM Symp. on Discrete Algorithms, pp. 1-10, 1997.
4. B. V. Cherkassky and A. V. Goldberg. Negative-cycle detection algorithms. In European Symp. on Algorithms. Lect. Notes in Comp. Sc. 1136, pp. 349-363, 1996.
5. B. V. Cherkassky, A. V. Goldberg, and T. Radzik. Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming, 73:129-174, 1996.
6. J. Edmonds, R. M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19:248-264, 1972.
7. P. G. Franciosa, D. Frigioni, and R. Giaccio. Semi-dynamic shortest paths and breadth-first search on digraphs. In Symp. on Theoretical Aspects of Computer Science. Lect. Notes in Comp. Sc. 1200, pp. 33-46, 1997.
8. D. Frigioni, M. Ioffreda, U. Nanni, G. Pasqualone. Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem. ACM Journal on Experimental Algorithmics, 3: Article 5 (1998).
9. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Fully dynamic algorithms for maintaining shortest paths trees. Journal of Algorithms, 34(2):351-381, 2000.
10. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Fully dynamic shortest paths and negative cycles detection on digraphs with arbitrary arc weights. In European Symp. on Algorithms. Lect. Notes in Comp. Sc. 1461, pp. 320-331, 1998.
11. D. Frigioni, T. Miller, U. Nanni, G. Pasqualone, G. Shaefer, C. Zaroliagis. An experimental study of dynamic algorithms for directed graphs. In European Symp. on Algorithms. Lect. Notes in Comp. Sc. 1461, pp. 368-380, 1998.
12. A. V. Goldberg. Selecting problems for algorithm evaluation. In Workshop on Algorithm Engineering. Lect. Notes in Comp. Sc. 1668, pp. 1-11, 1999.
13. A. V. Goldberg, and T. Radzik. A heuristic improvement of the Bellman-Ford algorithm. Applied Math. Letters, 6:3-6, 1993.
14. K. Mehlhorn and S. Naher. leda, a platform for combinatorial and geometric computing. Communications of the ACM, 38:96-102, 1995.
15. G. Ramalingam. Bounded incremental computation. Lect. Notes in Comp. Sc. 1089, 1996.
16. G. Ramalingam and T. Reps. On the computational complexity of dynamic graph problems. Theoretical Computer Science, 158:233-277, 1996.