A Fully Dynamic Algorithm for Distributed Shortest Paths (2003)
Cached
Download Links
- [dsiaq.ing.univaq.it]
- [dsiaq.ing.univaq.it]
- DBLP
Other Repositories/Bibliography
by
Serafino Cicerone
,
Gabriele Di Stefano
,
Daniele Frigioni
,
Umberto Nanni
| Venue: | Theoretical Computer Science |
| Citations: | 9 - 6 self |
BibTeX
@ARTICLE{Cicerone03afully,
author = {Serafino Cicerone and Gabriele Di Stefano and Daniele Frigioni and Umberto Nanni},
title = {A Fully Dynamic Algorithm for Distributed Shortest Paths},
journal = {Theoretical Computer Science},
year = {2003},
volume = {297},
pages = {1--3}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 modi cation (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.
