... that can provably approximate a clustering problem on graphs using only a constant number of MPC rounds in the sublinear memory regime.
確定! 回上一頁