Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios
From MaRDI portal
Publication:905697
DOI10.1007/s00224-015-9608-6zbMath1347.68018OpenAlexW2054131032MaRDI QIDQ905697
Daniele Frigioni, Mattia D'Emidio, Gianlorenzo D'Angelo, Daniele Romano
Publication date: 28 January 2016
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-015-9608-6
shortest pathsdistributed algorithmsdynamic algorithmscomputer communication networksexperimental analysisdesign and analysis of algorithms
Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A loop-free shortest-path routing algorithm for dynamic networks
- 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
- Emergence of Scaling in Random Networks
- Another adaptive distributed shortest path algorithm
- On finding and updating shortest paths distributively
- Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Distributed shortest-path protocols for time-dependent networks