scientific article; zbMATH DE number 1512693

MaRDI QIDQ4508381zbMATH OpenFDO

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

Publication date 3 October 2000

zbMATH Keywords

all-pairs shortest paths problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• A fully dynamic algorithm for distributed shortest paths.
• Partially dynamic efficient algorithms for distributed shortest paths
• Engineering a new algorithm for distributed shortest paths on dynamic networks
• scientific article; zbMATH DE number 749816
• Enhancing the computation of distributed shortest paths on real dynamic networks
• Improved distributed algorithms for exact shortest paths
• Faster distributed shortest path approximations via shortcuts
• Distributed algorithms for computing shortest pairs of disjoint paths
• Another adaptive distributed shortest path algorithm

Cited in

(12)

• 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
• scientific article; zbMATH DE number 6500497 (Why is no real title available?)
• Another adaptive distributed shortest path algorithm
• On finding and updating shortest paths distributively
• Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
• An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• scientific article; zbMATH DE number 7266346 (Why is no real title available?)
• Improved distributed algorithms for exact shortest paths
• Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios

This page was built for publication:

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