Distributed Strong Diameter Network Decomposition

DOI10.1145/2933057.2933094zbMath1373.68093OpenAlexW2476017094MaRDI QIDQ5361938

Ofer Neiman, Michael Elkin

Publication date: 29 September 2017

Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

distributed modelnetwork decompositions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (9)

Fast Distributed Approximation for Max-Cut ⋮ Sublinear-time distributed algorithms for detecting small cliques and even cycles ⋮ Distributed strong diameter network decomposition ⋮ Network Decomposition and Distributed Derandomization (Invited Paper) ⋮ Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions ⋮ The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs ⋮ Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications ⋮ Unnamed Item ⋮ Distributed Distance-Bounded Network Design Through Distributed Convex Programming

This page was built for publication: Distributed Strong Diameter Network Decomposition