Fully Dynamic Algorithms for Maintaining Shortest Paths Trees

Journal of Algorithms

Volumn 34, Issue 2, 2000, Pages 251-281

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

^a UNIVERSITY OF L'AQUILA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347999335     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1048     Document Type: Article

References (30)

1. R. K. Ahuia, T. L. Magnanti, and 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, and F. K. Zadeck, Incremental evaluation of computational circuits, in "Proceedings ACM-SIAM Symposium on Discrete Algorithms, pp. 32-42, San Francisco, 1990.
3. S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey, BIT 25 (1985), 2-23.
4. G. Ausiello, G. F. Italiano, A. Marchetti-Spaccamela, and U. Nanni, Incremental algorithms for minimal length paths, J. Algorithms 12 (1991), 615-638.
5. S. Chaudhuri and C. D. Zaroliagis, Shortest path queries in digraphs and small treewidth, in "Proceedings International Colloquium on Automata Languages and Programming, Szeged, Hungary, July 10-14, 1995," Lecture Notes in Computer Science, Vol. 944, pp. 244-255, Springer-Verlag, Berlin.
6. M. Chrobak and D. Eppstein, Planar orientations with low out-degree and compaction of adjacency matrices, Theoret. Comput. Sci. 86 (1991), 243-266.
7. E. W. Dijkstra, A note on two problems in connection with graphs, Numer. Math. 1 (1959), 269-271.
8. J. Edmonds, Minimum partition of a matroid into independent subsets, J. Res. Nat. Bur. Standards B 65 (1965), 67-72.
9. J. Edmonds, Lehman's switching game and a theorem of Nash-Williams, J. Res. Nat. Bur. Standards B 65 (1965), 73-77.
10. S. Even and H. Gazit, Updating distances in dynamic graphs, Methods Oper. Res. 49 (1985), 371-387.
11. E. Feuerstein and A. Marchetti-Spaccamela, On-line algorithms for shortest paths in planar graphs, Theoret. Comput. Sci. 116 (1993), 359-371.
12. P. G. Franciosa, D. Frigioni, and R. Giaccio, Semidynamic shortest paths and breadth-first search on digraphs, in "Proceedings Annual Symposium on Theoretical Aspects of Computer Science, Luebeck, Germany, February 27, 1997-March 1, 1997," Lecture Notes in Computer Science, Vol. 1200, pp. 33-46, Springer-Verlag, Berlin.
13. M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their use in improved network optimization algorithms, J. Assoc. Comput. Mach. 34 (1987), 596-615.
14. D. Frigioni, M. Ioffreda, U. Nani, and G. Pasqualone, Experimental analysis of dynamic algorithms for the single source shortest paths problem, ACM J. Exp. Algorithmics 3 (1998), 5.
15. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni, Semidynamic algorithms for maintaining single source shortest paths trees, Algorithmica 22, 3 (1998), 250-274.
16. A. V. Goldberg, Selecting problems for algorithm evaluation, in "Proceedings International Workshop on Algorithm Engineering, London, United Kingdom, July 19-21, 1999," Lecture Notes in Computer Science, Vol. 1688, pp. 1-11, Springer-Verlag, Berlin.
17. F. Harary, Graph Theory," Addison-Wesley, Reading, MA, 1969.
18. P. N. Klein, S. Rao, M. Rauch, and S. Subramanian, Faster shortest path algorithms for planar graphs, in "Proceedings ACM Symposium on Theory of Computing, Montreal, Quebec, Canada, May 23-25, 1994," pp. 27-37.
19. P. N. Klein and S. Subramanian, Fully dynamic approximation schemes for shortest paths problems in planar graphs, in "Proceedings International Workshop on Algorithms and Data Structures, Montreal, Canada, August 11-13, 1993," Lecture Notes in Computer Science, Vol. 709, pp. 443-451, Springer-Verlag, Berlin.
20. R. J. Lipton and R. E. Tarjan, A separator theorem for planar graphs, SIAM J. Appl. Math. 36 (1979), 177-189.
21. S. M. Malitz, Genus g graphs have pagenumber O(√g), J. Algorithms 17 (1994), 85-109.
22. K. Mehlhorn and S. Näher, LEDA: A platform for combinatorial and geometric computing, Comm. Assoc. Comput. Mach. 38 (1995), 96-102.
23. C. Nash-Williams, Edge-disjoint spanning trees of finite graphs, J. London Math. Soc. 36 (1961), 445-450.
24. G. Ramalingam and T. Reps, An incremental algorithm for a generalization of the shortest paths problem, J. Algorithms 21 (1996), 267-305.
25. G. Ramalingam and T. Reps, On the computational complexity of dynamic graph problems, Theoret. Comput. Sci. 158 (1996), 233-277.
26. G. Ramalingam, "Bounded Incremental Computation," Lecture Notes in Computer Science, Vol. 1089, Springer-Verlag, Berlin, 1996.
27. H. Rohnert, A dynamization of the all-pairs least cost paths problem, in "Proceedings 2nd Annual Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, January 3-5, 1985," Lecture Notes in Comput. Sci., Vol. 182, pp. 279-286, Springer-Verlag, Berlin.
28. J. Roskind and R. E. Tarjan, A note on finding minimum-cost edge-disjoint spanning trees, Math. Oper. Res. 10, 4 (1985), 701-708.
29. R. E. Tarjan, Amortized computational complexity, SIAM J. Algebraic Discrete Meth. 6 (1985), 306-318.
30. M. Thorup, Undirected single source shortest path in linear time, in "Proceedings IEEE Symposium on Foundations of Computer Science, Miami Beach, Florida, October 20-22, 1997," pp. 12-21.