Partially dynamic efficient algorithms for distributed shortest paths
From MaRDI portal
Publication:2268860
DOI10.1016/j.tcs.2009.11.008zbMath1187.68699OpenAlexW2030680125MaRDI QIDQ2268860
Daniele Frigioni, Gabriele Di Stefano, Serafino Cicerone, Gianlorenzo D'Angelo
Publication date: 9 March 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.11.008
Related Items
A loop-free shortest-path routing algorithm for dynamic networks ⋮ Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios ⋮ Engineering a new algorithm for distributed shortest paths on dynamic networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the computational complexity of dynamic graph problems
- A fully dynamic algorithm for distributed shortest paths.
- Another adaptive distributed shortest path algorithm
- On finding and updating shortest paths distributively
- Paths in graphs
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Distributed shortest-path protocols for time-dependent networks
- A new approach to dynamic all pairs shortest paths