Partially dynamic efficient algorithms for distributed shortest paths

DOI10.1016/J.TCS.2009.11.008MaRDI QIDQ2268860zbMATH OpenOpenAlexFDO

Authors Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni

Publication date 9 March 2010

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

Full work available at URL https://doi.org/10.1016/j.tcs.2009.11.008

zbMATH Keywords

distributed algorithmdynamic algorithmshortest paths

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• Engineering a new algorithm for distributed shortest paths on dynamic networks
• scientific article; zbMATH DE number 1512693
• A fully dynamic algorithm for distributed shortest paths.
• Another adaptive distributed shortest path algorithm
• Experimental analysis of dynamic all pairs shortest path algorithms

Cites work

• A fully dynamic algorithm for distributed shortest paths.
• A new approach to dynamic all pairs shortest paths
• Another adaptive distributed shortest path algorithm
• Distributed shortest-path protocols for time-dependent networks
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 4215340 (Why is no real title available?)
• On finding and updating shortest paths distributively
• On the computational complexity of dynamic graph problems
• Paths in graphs

Cited in

(10)

• A fully dynamic algorithm for distributed shortest paths.
• Engineering a new algorithm for distributed shortest paths on dynamic networks
• On the distributed Bellman-Ford algorithm and the looping problem
• A loop-free shortest-path routing algorithm for dynamic networks
• Another adaptive distributed shortest path algorithm
• scientific article; zbMATH DE number 1512693 (Why is no real title available?)
• Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
• Improved distributed algorithms for exact shortest paths
• Near-optimal approximate shortest paths and transshipment in distributed and streaming models
• Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios

Describes a project that uses

Uses Software

• OMNet++

This page was built for publication: Partially dynamic efficient algorithms for distributed shortest paths

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