skip to main content
article

A new approach to dynamic all pairs shortest paths

Published: 01 November 2004 Publication History

Abstract

We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynamic algorithm for general directed graphs with non-negative real-valued edge weights that supports any sequence of operations in O(n2log3n) amortized time per update and unit worst-case time per distance query, where n is the number of vertices. We can also report shortest paths in optimal worst-case time. These bounds improve substantially over previous results and solve a long-standing open problem. Our algorithm is deterministic, uses simple data structures, and appears to be very fast in practice.

References

[1]
Ausiello, G., Italiano, G., Marchetti-Spaccamela, A., and Nanni, U. 1991. Incremental algorithms for minimal length paths. J. Algorithms 12, 4, 615--38.
[2]
Baswana, S., Hariharan, R., and Sen, S. 2002. Improved decremental algorithms for transitive closure and all-pairs shortest paths. In Proceedings of the 34th ACM Symposium on Theory of Computing (STOC'02). ACM, New York, pp. 117--123.
[3]
Demetrescu, C., Emiliozzi, S., and Italiano, G. 2004. Experimental analysis of dynamic all pairs shortest path algorithms. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04). ACM, New York, pp. 362--371.
[4]
Demetrescu, C., and Italiano, G. 2001. Fully dynamic all pairs shortest paths with real edge weights. In Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science (FOCS'01) (Las Vegas, Nevada). IEEE Computer Society Press, Los Alamitos, Calif., pp. 260--267.
[5]
Demetrescu, C. and Italiano, G. 2002. Improved bounds and new trade-offs for dynamic all pairs shortest paths. In Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP'02) (Málaga, Spain). 633--643.
[6]
Even, S., and Gazit, H. 1985. Updating distances in dynamic graphs. Meth. Oper. Res. 49, 371--387.
[7]
Fakcharoemphol, J., and Rao, S. 2001. Planar graphs, negative weight edges, shortest paths, and near linear time. In Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science (FOCS'01) (Las Vegas, Nevada). IEEE Computer Society Press, Los Alamitos, Calif., pp. 232--241.
[8]
Frigioni, D., Marchetti-Spaccamela, A., and Nanni, U. 1998. Semi-dynamic algorithms for maintaining single source shortest paths trees. Algorithmica 22, 3, 250--274.
[9]
Frigioni, D., Marchetti-Spaccamela, A., and Nanni, U. 2000. Fully dynamic algorithms for maintaining shortest paths trees. J. Algorithms 34, 351--381.
[10]
Henzinger, M., Klein, P., Rao, S., and Subramanian, S. 1997. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55, 1 (Aug.), 3--23.
[11]
King, V. 1999. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS'99). IEEE Computer Society Press, Los Alamitos, Calif., pp. 81--99.
[12]
Loubal, P. 1967. A network evaluation procedure. Highway Research Record 205, 96--109.
[13]
Murchland, J. 1967. The effect of increasing or decreasing the length of a single arc on all shortest distances in a graph. Tech. rep., LBS-TNT-26, London Business School, Transport Network Theory Unit, London, UK.
[14]
Ramalingam, G., and Reps, T. 1996a. An incremental algorithm for a generalization of the shortest path problem. J. Algorithms 21, 267--305.
[15]
Ramalingam, G., and Reps, T. 1996b. On the computational complexity of dynamic graph problems. Theoret. Comput. Sci. 158, 233--277.
[16]
Rodionov, V. 1968. The parametric problem of shortest distances. U.S.S.R. Comput. Math. Math. Phys. 8, 5, 336--343.
[17]
Rohnert, H. 1985. A dynamization of the all-pairs least cost problem. In Proceedings of the 2nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'85). Lecture Notes in Computer Science, vol. 182, Springer-Verlag, New York, pp. 279--286.
[18]
Thorup, M. 2004. Fully-dynamic all-pairs shortest paths: Faster and allowing negative cycles. In Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT'04). 384--396.

Cited By

View all
  • (2024)A Swell Neural Network Algorithm for Solving Time-Varying Path Query Problems with Privacy ProtectionElectronics10.3390/electronics1307124813:7(1248)Online publication date: 27-Mar-2024
  • (2024)Path Algorithms for Contact Sequence Temporal GraphsAlgorithms10.3390/a1704014817:4(148)Online publication date: 30-Mar-2024
  • (2024)Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update TimeProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649695(1141-1152)Online publication date: 10-Jun-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM
Journal of the ACM  Volume 51, Issue 6
November 2004
191 pages
ISSN:0004-5411
EISSN:1557-735X
DOI:10.1145/1039488
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 2004
Published in JACM Volume 51, Issue 6

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Dynamic graph algorithms
  2. shortest paths

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)80
  • Downloads (Last 6 weeks)6
Reflects downloads up to 13 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)A Swell Neural Network Algorithm for Solving Time-Varying Path Query Problems with Privacy ProtectionElectronics10.3390/electronics1307124813:7(1248)Online publication date: 27-Mar-2024
  • (2024)Path Algorithms for Contact Sequence Temporal GraphsAlgorithms10.3390/a1704014817:4(148)Online publication date: 30-Mar-2024
  • (2024)Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update TimeProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649695(1141-1152)Online publication date: 10-Jun-2024
  • (2024)Near-Optimal $\left(1+\epsilon\right)-\text{Approximate}$ Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS61266.2024.00124(2078-2098)Online publication date: 27-Oct-2024
  • (2024)Dynamic Deterministic Constant-Approximate Distance Oracles with $n^{\epsilon}$ Worst-Case Update Time2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS61266.2024.00121(2033-2044)Online publication date: 27-Oct-2024
  • (2024)Distance queries over dynamic interval graphsComputational Geometry: Theory and Applications10.1016/j.comgeo.2024.102103122:COnline publication date: 18-Jul-2024
  • (2023)Multi-Objective Decision-Making Meets Dynamic Shortest Path: Challenges and ProspectsAlgorithms10.3390/a1603016216:3(162)Online publication date: 16-Mar-2023
  • (2023)Deterministic Incremental APSP with Polylogarithmic Update Time and StretchProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585213(1173-1186)Online publication date: 2-Jun-2023
  • (2023)A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest PathsProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585196(1159-1172)Online publication date: 2-Jun-2023
  • (2023)Deterministic Fully Dynamic SSSP and More2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00142(2312-2321)Online publication date: 6-Nov-2023
  • Show More Cited By

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media