Sparser: A Paradigm for Running Distributed Algorithms

DOI10.1006/JAGM.1993.1016MaRDI QIDQ4033771zbMATH OpenOpenAlexFDO

Authors Yehuda Afek, Moty Ricklin

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)

Recommendations

• Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation
• Fast deterministic distributed algorithms for sparse spanners
• Fast Deterministic Distributed Algorithms for Sparse Spanners
• Distributed memory compiler design for sparse problems
• Investigating the sparse simplex algorithm on a distributed memory multiprocessor
• scientific article; zbMATH DE number 42973
• scientific article; zbMATH DE number 18297
• Distributed spanner approximation
• Distributed Spanner Approximation
• On the locality of distributed sparse spanner construction

Cited in

(10)

• Low-diameter graph decomposition is in NC
• Computing all the best swap edges distributively
• Simple and efficient network decomposition and synchronization
• Integer sparse distributed memory: analysis and results
• An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages
• Sublinear fully distributed partition with applications
• Local Maps: New Insights into Mobile Agent Algorithms
• Efficient distributed approximation algorithms via probabilistic tree embeddings
• New bounds for the controller problem
• scientific article; zbMATH DE number 3999275 (Why is no real title available?)

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

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