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

DOI10.1006/JAGM.1996.0842zbMATH Open0879.68008OpenAlexW2061073017MaRDI QIDQ4349697FDOQ4349697

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

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

zbMATH Keywords

distributed program

Mathematics Subject Classification ID

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

Cited In (10)

• Distributed algorithms for computing shortest pairs of disjoint paths
• A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem
• Distributed finite-time calculation of node eccentricities, graph radius and graph diameter
• Title not available (Why is that?)
• Distributed distance computation and routing with small messages
• Fault-tolerant computation of distributed regular path queries
• An Improved Distribution Algorithm for Shortest Paths Problem
• A fully dynamic algorithm for distributed shortest paths.
• A distributed shortest path algorithm for a planar network
• An improved Dijkstra's shortest path algorithm for sparse 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)