An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages

DOI10.1007/3-540-57899-4_65MaRDI QIDQ6184631zbMATH OpenOpenAlexFDO

Authors

Publication date 5 January 2024

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57899-4_65

Mathematics Subject Classification ID

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

Recommendations

• An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
• Shortest route computation in distributed systems
• An Improved Distribution Algorithm for Shortest Paths Problem
• A linear-time optimal-message distributed algorithm for minimum spanning trees
• Sparser: A Paradigm for Running Distributed Algorithms

Cites work

• A note on two problems in connexion with graphs
• A Theorem on Boolean Matrices
• Distributed network protocols
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• Introduction to algorithms
• Matroids and the greedy algorithm
• Sparser: A Paradigm for Running Distributed Algorithms

This page was built for publication: An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages

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