Abstract
We propose a fully-dynamic distributed algorithm for the all-pairs shortest paths problem on general networks with positive real edge weights. If δσ is the number of pairs of nodes changing the distance after a single edge modification σ (insert, delete, weight-decrease, or weight-increase) then the message complexity of the proposed algorithm is O(nδσ) in the worst case, where n is the number of nodes of the network. If δσ = o(n2), this is better than recomputing everything from scratch after each edge modification. © Springer-Verlag Berlin Heidelberg 2000.
Cite
CITATION STYLE
Cicerone, S., Di Stefano, G., Frigioni, D., & Nanni, U. (2000). A fully dynamic algorithm for distributed shortest paths. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1776 LNCS, pp. 247–257). https://doi.org/10.1007/10719839_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
