A fully dynamic algorithm for distributed shortest paths
2003
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 dis...
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI