Re:Runtime improvement for Minimum Cut algorithm first time ...
by ivanbakel on Monday January 11, 2021 @07:45AM
(#25728163)
Wikipedia has a nice diagram on another page[0] - in a weighted graph where all nodes have enough connections, separating just a single node is likely to cost more than finding some cheap partition between two groups.
[0] https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm...