A new approach to dynamic all pairs shortest paths

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 159-166

  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; COMPUTATION THEORY; GRAPH THEORY; PROBLEM SOLVING;

SHORTEST PATH PROBLEM;

COMPUTER SCIENCE;

EID: 0038784682     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780567     Document Type: Conference Paper

References (19)

1. G. Ausiello, G. Italiano, A. Marchetti-Spaccamela, and U. Nanni. Incremental algorithms for minimal length paths. Journal of Algorithms, 12(4):615-38, 1991.
2. S. Baswana, R. Hariharan, and S. Sen. Improved decremental algorithms for transitive closure and all-pairs shortest paths. In Proc. 34th ACM Symposium on Theory of Computing (STOC'02), pages 117-123, 2002.
3. C. Demetrescu and G. 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, pages 260-267, 2001.
4. C. Demetrescu and G. Italiano. Improved bounds and new trade-offs for dynamic all pairs shortest paths. In Proc. of the 29-th International Colloquium on Automata, Languages, and Programming (ICALP'02), Malaga, Spain, 2002.
5. E. Dijkstra. A note on two problems in connection with graphs. Numerische Mathematik, 1:269-271, 1959.
6. S. Even and H. Gazit. Updating distances in dynamic graphs. Methods of Operations Research, 49:371-387, 1985.
7. J. Fakcharoemphol and 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, pages 232-241, 2001.
8. M. Fredman and R. Tarjan. Fibonacci heaps and their use in improved network optimization algorithms. Journal of the ACM, 34:596-615, 1987.
9. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Semi-dynamic algorithms for maintaining single source shortest paths trees. Algorithmica, 22(3):250-274, 1998.
10. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Fully dynamic algorithms for maintaining shortest paths trees. Journal of Algorithms, 34:351-381, 2000.
11. D. Greene and D. Knuth. Mathematics for the analysis of algorithms. Birkhäuser, 1982.
12. M. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55(1):3-23, Aug. 1997.
13. V. King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS'99), pages 81-99, 1999.
14. P. Loubal. A network evaluation procedure. Highway Research Record 205, pages 96-109, 1967.
15. J. Murchland. 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, Transport Network Theory Unit, London, UK, 1967.
16. G. Ramalingam and T. Reps. An incremental algorithm for a generalization of the shortest path problem. Journal of Algorithms, 21:267-305, 1996.
17. G. Ramalingam and T. Reps. On the computational complexity of dynamic graph problems. Theoretical Computer Science, 158:233-277, 1996.
18. V. Rodionov. The parametric problem of shortest distances. U.S.S.R. Computational Math, and Math. Phys., 8(5):336-343, 1968.
19. H. Rohnert. A dynamization of the all-pairs least cost problem. In Proc. 2nd Annual Symposium on Theoretical Aspects of Computer Science, (STACS'85), LNCS 182, pages 279-286, 1985.