An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages

DOI10.1006/JAGM.1996.0842MaRDI QIDQ4349697zbMATH OpenOpenAlexFDO

Authors

Publication date 17 December 1997

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1996.0842

zbMATH Keywords

distributed program

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)

Recommendations

• A fully dynamic algorithm for distributed shortest paths.
• An Improved Distribution Algorithm for Shortest Paths Problem
• A distributed shortest path algorithm for a planar network
• scientific article; zbMATH DE number 1512693
• scientific article; zbMATH DE number 1304097

Cited in

(12)

• Fault-tolerant computation of distributed regular path queries
• A fully dynamic algorithm for distributed shortest paths.
• Distributed distance computation and routing with small messages
• A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
• Distributed finite-time calculation of node eccentricities, graph radius and graph diameter
• An Improved Distribution Algorithm for Shortest Paths Problem
• scientific article; zbMATH DE number 4076593 (Why is no real title available?)
• Distributed algorithms for computing shortest pairs of disjoint paths
• An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages
• A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem
• An improved Dijkstra's shortest path algorithm for sparse network
• A distributed shortest path algorithm for a planar network

This page was built for publication: An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages

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