Massively Parallel Algorithms for Minimum Cut
PODC '20: ACM Symposium on Principles of Distributed Computing Virtual Event Italy August, 2020(2020)
摘要
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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络