A fully dynamic algorithm for distributed shortest paths

@article{Cicerone2003AFD,
  title={A fully dynamic algorithm for distributed shortest paths},
  author={Serafino Cicerone and Gabriele Di Stefano and Daniele Frigioni and Umberto Nanni},
  journal={Theor. Comput. Sci.},
  year={2003},
  volume={297},
  pages={83-102}
}
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… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Distributed shortest-path and minimum-delay protocols in networks with time-dependent edge-length

  • A. Orda, R. Rom
  • Distributed Computing, 10
  • 1996
1 Excerpt

Reps . On the computational complexity of dynamic graph problems

  • S. Venkatesan
  • Theoretical Computer Science
  • 1996

Network Flows: Theory

  • R. K. Ahuia, T. L. Magnanti, J. B. Orlin
  • Algorithms and Applications. Prentice Hall…
  • 1993

Similar Papers

Loading similar papers…