Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios

DOI10.1007/S00224-015-9608-6zbMATH Open1347.68018OpenAlexW2054131032MaRDI QIDQ905697FDOQ905697

Daniele Frigioni, Mattia D'Emidio, Gianlorenzo D'Angelo, Daniele Romano

Publication date: 28 January 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-015-9608-6

zbMATH Keywords

shortest pathsdistributed algorithmsexperimental analysisdynamic algorithmsdesign and analysis of algorithmscomputer communication networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Emergence of Scaling in Random Networks
• Distributed shortest-path protocols for time-dependent networks
• A fully dynamic algorithm for distributed shortest paths.
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• Engineering a new algorithm for distributed shortest paths on dynamic networks
• Partially dynamic efficient algorithms for distributed shortest paths
• A loop-free shortest-path routing algorithm for dynamic networks
• Another adaptive distributed shortest path algorithm
• On finding and updating shortest paths distributively
• Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks

Uses Software

• OMNet++

This page was built for publication: Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios

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