Abstract
We present two Massively Parallel Computation (MPC) algorithms for the Minimum Cut problem: an O(1)-round exact algorithm with Õ(n) memory per machine, and an O(log n · log log n) round (2 + ϵ) approximation with Õ(nα) memory per machine, for any positive constant α < 1. Both algorithms use Õ(m) global memory.
Author supplied keywords
Cite
CITATION STYLE
APA
Ghaffari, M., & Nowicki, K. (2020). Massively Parallel Algorithms for Minimum Cut. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 119–128). Association for Computing Machinery. https://doi.org/10.1145/3382734.3405737
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free