Sparser: A Paradigm for Running Distributed Algorithms

DOI10.1006/jagm.1993.1016zbMath0773.68034OpenAlexW2046018957MaRDI QIDQ4033771

Moty Ricklin, Yehuda Afek

Publication date: 16 May 1993

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

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

zbMATH Keywords

distributed algorithmscommunication complexitybreadth-first search algorithmall shortest paths algorithm

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (8)

Low-diameter graph decomposition is in NC ⋮ An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages ⋮ Computing all the best swap edges distributively ⋮ Sublinear fully distributed partition with applications ⋮ Local Maps: New Insights into Mobile Agent Algorithms ⋮ New bounds for the controller problem ⋮ Efficient distributed approximation algorithms via probabilistic tree embeddings ⋮ Simple and efficient network decomposition and synchronization

This page was built for publication: Sparser: A Paradigm for Running Distributed Algorithms