Fully dynamic shortest paths in diagraphs with arbitrary arc weights

Journal of Algorithms

Volumn 49, Issue 1, 2003, Pages 86-113

  Frigioni, Daniele ^a   Marchetti Spaccamela, Alberto ^b   Nanni, Umberto ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Dynamic algorithms; Output complexity; Shortest paths; Zero length cycles

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COSTS; PROBLEM SOLVING;

ARBITRARY ARC WEIGHTS; DIGRAPHS; ZERO-LENGTH CYCLES;

GRAPH THEORY;

EID: 0242499156     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00082-8     Document Type: Article

References (18)

1. R.K. Ahuia, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice Hall, Englewood, Cliffs, NJ, 1993.
2. B. Alpern, R. Hoover, B.K. Rosen, P.F. Sweeney, F.K. Zadeck, Incremental evaluation of computational circuits, in: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, 1990, pp.32-42.
3. G. Ausiello, G.F. Italiano, A. Marchetti-Spaccamela, U. Nanni, Incremental algorithms for minimal length paths, J. Algorithms 12 (4) (1991) 615.
4. S. Chaudhuri, C.D. Zarogliagis, Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms, Algorithmica 27 (3) (2000) 212-226.
5. M. Chrobak, D. Eppstein, Planar orientations with low out-degree and compaction of adjacency matrices, Theoret. Comput. Sci. 86 (1991) 243-266.
6. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
7. T.H. Demetrescu, D. Frigioni, A. Marchetti-Spaccamela, U. Nanni, Maintaining shortest paths in digraphs with arbitrary arc weights: an experimental study, in: Proceedings of the 3rd Workshop on Algorithm Engineering, in: Lecture Notes in Comput. Sci., 2000, submitted for publication.
8. J. Edmonds, R.M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems, J. ACM 19 (1972) 248-264.
9. S. Even, H. Gazit, Updating distances in dynamic graphs, Methods Oper. Res. 49 (1985) 371-387.
10. P.G. Franciosa, D. Frigioni, R. Giaccio, Semi-dynamic breadth-first search in digraphs, Theoret. Comput. Sci. 250 (2000) 201-217.
11. D. Frigioni, M. Ioffreda, U. Nanni, G. Pasqualone, Experimental analysis of dynamic algorithms for the single source shortest paths problem, ACM J. Exp. Algorithmics 3 (1998), Article 5.
12. D. Friogioni, A. Marchetti-Spaccamela, U. Nanni, Semi dynamic algorithms for maintaining single source shortest paths trees, Algorithmica 22 (1998)(3), 250-274.
13. D. Frigioni, A. Marchetti-Spaccamela, U. Nanni, Fully dynamic algorithms for maintaining shortest paths trees, J. Algorithms 34 (2000)(2), 251-281.
14. P.N. Klein, S. Rao, M. Rauch, S. Subramanian, Faster shortest-path algorithms for planar graphs, J. Comput. System Sci. 55 (1) (1997) 3-23.
15. G. Ramalingam, Bounded Incremental Computation, in: Lecture Notes in Comput. Sci., Vol. 1089, 1996.
16. G. Ramalingam, T. Reps, On the computational complexity of dynamic graph problems, Theoret. Comput. Sci. 158 (1996) 233-277.
17. G. Ramalingam, T. Reps, An incremental algorithm for a generalization of the shortest paths problem, J. Algorithms 21 (1996) 267-305.
18. H. Rohnert, A dynamization of the all-pairs least cost paths problem, in: Proc. 2nd Annual Symposium on Theoretical Aspects of Computer Science, in: Lecture Notes in Comput. Sci., Vol. 182, 1985, pp. 279-286.