A loop-free shortest-path routing algorithm for dynamic networks
From MaRDI portal
Publication:385951
DOI10.1016/j.tcs.2013.11.001zbMath1277.68037WikidataQ115036544 ScholiaQ115036544MaRDI QIDQ385951
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
Publication date: 13 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.11.001
Related Items
Fully Dynamic 2-Hop Cover Labeling, Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios
Cites Work
- Unnamed Item
- Unnamed Item
- Termination detection for diffusing computations
- A fully dynamic algorithm for distributed shortest paths.
- Engineering a new algorithm for distributed shortest paths on dynamic networks
- Partially dynamic efficient algorithms for distributed shortest paths
- Another adaptive distributed shortest path algorithm
- On finding and updating shortest paths distributively
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Distributed shortest-path protocols for time-dependent networks