A fully dynamic algorithm for distributed shortest paths.
From MaRDI portal
Publication:1401293
DOI10.1016/S0304-3975(02)00619-9zbMATH Open1044.68165OpenAlexW2657967087MaRDI QIDQ1401293FDOQ1401293
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
Recommendations
Cites Work
- Network flows. Theory, algorithms, and applications.
- An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
- Distributed shortest-path protocols for time-dependent networks
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Bounded incremental computation
- Another adaptive distributed shortest path algorithm
- On finding and updating shortest paths distributively
- On the computational complexity of dynamic graph problems
- Incremental algorithms for minimal length paths
- Title not available (Why is that?)
- Semidynamic algorithms for maintaining single-source shortest path trees
Cited In (11)
- Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
- An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
- Title not available (Why is that?)
- Engineering a new algorithm for distributed shortest paths on dynamic networks
- Fast computation of bounds for two-terminal network reliability
- Partially dynamic efficient algorithms for distributed shortest paths
- Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios
- Another adaptive distributed shortest path algorithm
- On finding and updating shortest paths distributively
- Enhancing the computation of distributed shortest paths on real dynamic networks
- A loop-free shortest-path routing algorithm for 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)
