A fully dynamic algorithm for distributed shortest paths.

DOI10.1016/S0304-3975(02)00619-9MaRDI QIDQ1401293zbMATHOpenAlexFDO

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

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)

Recommendations

• scientific article; zbMATH DE number 1512693
• Engineering a new algorithm for distributed shortest paths on dynamic networks
• On finding and updating shortest paths distributively
• A new approach to dynamic all pairs shortest paths
• Partially dynamic efficient algorithms for distributed shortest paths

Cites work

• scientific article; zbMATH DE number 432748 (Why is no real title available?)
• An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
• Another adaptive distributed shortest path algorithm
• Bounded incremental computation
• Distributed shortest-path protocols for time-dependent networks
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• Incremental algorithms for minimal length paths
• Network flows. Theory, algorithms, and applications.
• On finding and updating shortest paths distributively
• On the computational complexity of dynamic graph problems
• Semidynamic algorithms for maintaining single-source shortest path trees

Cited in

(11)

• Enhancing the computation of distributed shortest paths on real dynamic networks
• scientific article; zbMATH DE number 1512693 (Why is no real title available?)
• Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
• Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios
• A loop-free shortest-path routing algorithm for dynamic networks
• Partially dynamic efficient algorithms for distributed shortest paths
• Another adaptive distributed shortest path algorithm
• On finding and updating shortest paths distributively
• An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
• Fast computation of bounds for two-terminal network reliability
• Engineering a new algorithm for distributed shortest paths on dynamic networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401293)