Re:Solving the minimum cut problem for undirected graphs
by sltkr on Wednesday April 17, 2024 @06:07PM
(#40070564)
The problem with Karger's algorithm isn't that it's randomized, but that even the expected runtime is orders of magnitude worse than this new deterministic algorithm.
For that reason I wouldn't call it amazing though it is an interesting algorithm.
For that reason I wouldn't call it amazing though it is an interesting algorithm.