Efficient distributed source detection with limited bandwidth

DOI10.1145/2484239.2484262zbMath1323.68421OpenAlexW2107282727MaRDI QIDQ5176116

Christoph Lenzen, David Peleg

Publication date: 2 March 2015

Published in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2484239.2484262

zbMATH Keywords

compact routingadditive spannersall-to-all shortest pathsBellmann-Fordconcurrent incomplete breadth-first searchdistance and diameter computation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (13)

Single-source shortest paths in the CONGEST model with improved bounds ⋮ Distributed distance computation and routing with small messages ⋮ The sparsest additive spanner via multiple weighted BFS trees ⋮ Distributed Graph Algorithms and their Complexity: An Introduction ⋮ On efficient distributed construction of near optimal routing schemes ⋮ Algebraic methods in the congested clique ⋮ Distributed construction of purely additive spanners ⋮ Fast distributed algorithms for testing graph properties ⋮ Graph spanners: a tutorial review ⋮ The Sparsest Additive Spanner via Multiple Weighted BFS Trees ⋮ Fast approximate shortest paths in the congested clique ⋮ A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths ⋮ Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time

This page was built for publication: Efficient distributed source detection with limited bandwidth