Fully dynamic all pairs shortest paths with real edge weights

Journal of Computer and System Sciences

Volumn 72, Issue 5, 2006, Pages 813-837

  Demetrescu, Camil ^a   Italiano, Giuseppe F ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Dynamic graph algorithms; Shortest paths

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; GRAPH THEORY; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; QUERY LANGUAGES;

DYNAMIC GRAPH ALGORITHMS; OPTIMAL WORST-CASE TIME; RANDOMIZED ALGORITHM; SHORTEST PATHS;

DYNAMIC PROGRAMMING;

EID: 33747479905     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2005.05.005     Document Type: Article

References (38)

1. Aho A.V., Hopcroft J.E., and Ullman J.D. The Design and Analysis of Computer Algorithms (1974), Addison-Wesley
2. Alon N., Galil Z., and Margalit O. On the exponent of the all pairs shortest path problem. J. Comput. System Sci. 54 2 (1997) 255-262
3. Ausiello G., Italiano G.F., Marchetti-Spaccamela A., and Nanni U. Incremental algorithms for minimal length paths. J. Algorithms 12 4 (1991) 615-638
4. Coppersmith D., and Winograd S. Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9 (1990) 251-280
5. Cormen T.H., Leiserson C.E., and Rivest R.L. Introduction to Algorithms (1990), MIT Press
6. C. Demetrescu, Fully dynamic algorithms for path problems on directed graphs, PhD thesis, Department of Computer and Systems Science, University of Rome "La Sapienza", February, 2001
7. 2 ) barrier. Proc. of the 41st IEEE Annual Symposium on Foundations of Computer Science, FOCS '00 (2000) 381-389. http://arXiv.org/abs/cs.DS/0104001 full paper available at the URL:
8. C. Demetrescu, G.F. Italiano, Fully dynamic all pairs shortest paths with real edge weights, in: Proc. of the 42nd IEEE Annual Symposium on Foundations of Computer Science, FOCS '01, Las Vegas, Nevada, 2001, pp. 260-267
9. C. Demetrescu, G.F. Italiano, Improved bounds and new trade-offs for dynamic all pairs shortest paths, in: Proc. of the 29th International Colloquium on Automata, Languages, and Programming, ICALP '02, Málaga, Spain, 2002, pp. 633-643
10. Demetrescu C., and Italiano G.F. A new approach to dynamic all pairs shortest paths. J. Assoc. Comput. Machinery 51 6 (2004) 968-992 a preliminary version in: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC '03, 2003 pp. 159-166
11. Even S., and Gazit H. Updating distances in dynamic graphs. Methods Oper. Res. 49 (1985) 371-387
12. J. Fakcharoemphol, S. Rao, Planar graphs, negative weight edges, shortest paths, and near linear time, in: Proc. of the 42nd IEEE Annual Symposium on Foundations of Computer Science, FOCS '01, Las Vegas, Nevada, 2001, pp. 232-241
13. Fredman M.L. New bounds on the complexity of the shortest path problems. SIAM J. Comput. 5 (1976) 87-89
14. Fredman M.L., and Tarjan R.E. Fibonacci heaps and their use in improved network optimization algorithms. J. ACM 34 (1987) 596-615
15. Frigioni D., Marchetti-Spaccamela A., and Nanni U. Semi-dynamic algorithms for maintaining single source shortest paths trees. Algorithmica 22 3 (1998) 250-274
16. Frigioni D., Marchetti-Spaccamela A., and Nanni U. Fully dynamic algorithms for maintaining shortest paths trees. J. Algorithms 34 (2000) 351-381
17. Galil Z., and Margalit O. All pairs shortest paths for graphs with small integer length edges. J. Comput. System Sci. 54 2 (1997) 243-254
18. Greene D.H., and Knuth D.E. Mathematics for the Analysis of Algorithms (1982), Birkhäuser
19. M. Henzinger, V. King, Fully dynamic biconnectivity and transitive closure, in: Proc. 36th IEEE Symposium on Foundations of Computer Science, FOCS '95, 1995, pp. 664-672
20. Henzinger M., and King V. Maintaining minimum spanning trees in dynamic graphs. Proc. 24th Int. Coll. Automata, Languages, and Programming. Lecture Notes in Comput. Sci. vol. 1256 (1997), Springer-Verlag 594-604
21. Henzinger M.R., and King V. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM 46 4 (1999) 502-516
22. Henzinger M.R., Klein P., Rao S., and Subramanian S. Faster shortest-path algorithms for planar graphs. J. Comput. System Sci. 55 1 (1997) 3-23
23. Holm J., de Lichtenberg K., and Thorup M. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48 (2001) 723-760
24. King V. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. Proc. 40th IEEE Symposium on Foundations of Computer Science, FOCS '99 (1999) 81-99
25. King V., and Thorup M. A space saving trick for directed dynamic transitive closure and shortest path algorithms. Proceedings of the 7th Annual International Computing and Combinatorics Conference, COCOON. Lecture Notes in Comput. Sci. vol. 2108 (2001) 268-277
26. Loubal P. A network evaluation procedure. Highway Res. Record 205 (1967) 96-109
27. Moy J. OSPF: Anatomy of an Internet Routing Protocol (1999), Addison-Wesley
28. Murchland J. The effect of increasing or decreasing the length of a single arc on all shortest distances in a graph, Technical report, LBS-TNT-26, London Business School (1967), Transport Network Theory Unit, London, UK
29. Ramalingam G., and Reps T. An incremental algorithm for a generalization of the shortest path problem. J. Algorithms 21 (1996) 267-305
30. Ramalingam G., and Reps T. On the computational complexity of dynamic graph problems. Theoret. Comput. Sci. 158 (1996) 233-277
31. Rodionov V. The parametric problem of shortest distances. USSR Comput. Math. Math. Phys. 8 5 (1968) 336-343
32. P. Sankowski, Dynamic transitive closure via dynamic matrix inverse, in: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS '04, Rome, Italy, 2004
33. Seidel R. On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. System Sci. 51 3 (1995) 400-403
34. A. Shoshan, U. Zwick, All pairs shortest paths in undirected graphs with integer weights, in: 40th Annual Symposium on Foundations of Computer Science: 17-19 October, 1999, New York, 1999, pp. 605-614
35. Takaoka T. A new upper bound on the complexity of the all pairs shortest path problem. Inform. Process. Lett. 43 4 (1992) 195-199
36. M. Thorup, Fully-dynamic all-pairs shortest paths: Faster and allowing negative cycle, in: Proceedings of the 9th Scandinavian Workshop on Algorithm Theory, SWAT '04, 2004, pp. 384-396
37. Ullman J.D., and Yannakakis M. High-probability parallel transitive-closure algorithms. SIAM J. Comput. 20 1 (1991) 100-125
38. Zwick U. All pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM 49 3 (2002) 289-317