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

DOI10.1007/3-540-57899-4_65zbMath1528.68292OpenAlexW1246069834MaRDI QIDQ6184631

No author found.

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)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Distributed network protocols
• Sparser: A Paradigm for Running Distributed Algorithms
• Matroids and the greedy algorithm
• A Theorem on Boolean Matrices

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