32 citations · 63 across the 6 of their papers we have counts for
1 paper · 1 filter
Alexandr Andoni, Clifford Stein, Zhao Song +2
We study graph connectivity problem in MPC model. On an undirected graph with n nodes and m edges, O(logn) round connectivity algorithms have been known for over 35 years.…