Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs

DOI10.1145/3293611.3331596OpenAlexW2963629655MaRDI QIDQ5145258

Sepehr Assadi, Xiaorui Sun, Omri Weinstein

Publication date: 20 January 2021

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

Full work available at URL: https://arxiv.org/abs/1805.02974

zbMATH Keywords

spectral gaprandom walksparse connectivity

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (6)

Equivalence classes and conditional hardness in massively parallel computations ⋮ Deterministic Massively Parallel Connectivity ⋮ Time-optimal construction of overlay networks ⋮ Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions ⋮ Maliciously secure massively parallel computation for all-but-one corruptions ⋮ Unnamed Item

This page was built for publication: Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs