MST in Log-Star Rounds of Congested Clique
From MaRDI portal
Publication:5361911
DOI10.1145/2933057.2933103zbMath1376.68109OpenAlexW2488670996MaRDI QIDQ5361911
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.2933103
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items (16)
Graph reconstruction in the congested clique ⋮ Derandomizing local distributed algorithms under bandwidth restrictions ⋮ Fault-tolerant graph realizations in the congested clique ⋮ Exact distributed sampling ⋮ A distributed algorithm for directed minimum-weight spanning tree ⋮ Distributed PageRank computation with improved round complexities ⋮ Brief Announcement: What Can We Compute in a Single Round of the Congested Clique? ⋮ Deterministic Fault-Tolerant Connectivity Labeling Scheme ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fast approximate shortest paths in the congested clique ⋮ Sparsifying Congested Cliques and Core-Periphery Networks ⋮ Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE ⋮ Near-optimal scheduling in the congested clique ⋮ Approximate minimum directed spanning trees under congestion
This page was built for publication: MST in Log-Star Rounds of Congested Clique
