Engineering a new algorithm for distributed shortest paths on dynamic networks

DOI10.1007/s00453-012-9623-9zbMath1262.68019OpenAlexW2052159237MaRDI QIDQ1949761

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

Publication date: 16 May 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-00728876/file/main.pdf

zbMATH Keywords

shortest pathsdynamic algorithmsexperimental analysisdistributed networksconcurrent update

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items

A loop-free shortest-path routing algorithm for dynamic networks ⋮ Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios

Uses Software

• OMNet++

Cites Work

• Unnamed Item
• Unnamed Item
• A fully dynamic algorithm for distributed shortest paths.
• Partially dynamic efficient algorithms for distributed shortest paths
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Another adaptive distributed shortest path algorithm
• On finding and updating shortest paths distributively
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees