105 citations · 146 across the 19 of their papers we have counts for
1 paper · 1 filter
Raphael Yuster
We present a new randomized algorithm for computing the diameter of a weighted directed graph. The algorithm runs in $\Ot(M^{\w/(\w+1)}n^{(\w^2+3)/(\w+1)})$ time, where $\w < 2.376…