Report copyright - Algebraic Methods in the Congested Clique · pairs shortest paths can be computed in O(n1=3 logndlogM=logne) communication rounds. We can leverage fast ring matrix multiplication
Please pass captcha verification before submit form
Please pass captcha verification before submit form