Theorem: With high probability we can find all min cuts in the running time of O ( n 2 ln 3 ⁡ n ) {\displaystyle O(n^{2}\ln ^{3}n)} .
Teorema: Sa velikom verovatnoćom možemo naći sve minimalne rezove u vremenu O ( n 2 ln 3 ⁡ n ) {\displaystyle O(n^{2}\ln ^{3}n)} .