The lower bounds on distributed shortest paths

DOI10.1016/0020-0190(93)90257-AzbMath0788.68065OpenAlexW2009638991MaRDI QIDQ1313759

V. Pereyra

Publication date: 24 February 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90257-a

zbMATH Keywords

distributed systemsshortest pathscommunication complexitymessage complexities

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (1)

Fault-tolerant computation of distributed regular path queries

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Distributed computation on graphs
• On finding and updating shortest paths distributively
• On Finding and Updating Spanning Trees and Shortest Paths
• A Shortest Path Algorithm for Edge-Sparse Graphs

This page was built for publication: The lower bounds on distributed shortest paths