A fully dynamic algorithm for distributed shortest paths.

DOI10.1016/S0304-3975(02)00619-9zbMath1044.68165OpenAlexW2657967087MaRDI QIDQ1401293

Gabriele Di Stefano, Umberto Nanni, Serafino Cicerone, Daniele Frigioni

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00619-9

zbMATH Keywords

shortest pathsdynamic distributed environment

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (5)

Fast computation of bounds for two-terminal network reliability ⋮ 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 ⋮ Partially dynamic efficient algorithms for distributed shortest paths

Cites Work

• Unnamed Item
• Unnamed Item
• Semidynamic algorithms for maintaining single-source shortest path trees
• On the computational complexity of dynamic graph problems
• Bounded incremental computation
• Another adaptive distributed shortest path algorithm
• Incremental algorithms for minimal length paths
• On finding and updating shortest paths distributively
• An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• Distributed shortest-path protocols for time-dependent networks

This page was built for publication: A fully dynamic algorithm for distributed shortest paths.