215 citations · 792 across the 83 of their papers we have counts for
1 paper · 1 filter
Monika Henzinger, Jason Li, Satish Rao +1
In 1996, Karger [Kar96] gave a startling randomized algorithm that finds a minimum-cut in a (weighted) graph in time O(mlog3n) which he termed near-linear time meaning linear (…