A cut is a partition of a graph's nodes into two classes. Each cut is associated with a cut-set, the set of edges straddling the cut. For more, see: https://en.wikipedia.org/wiki/Minimum_cut https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm https://en.wikipedia.org/wiki/Karger%27s_algorithm
About
Stats
|
created |
7 years, 1 month ago |
|
viewed |
3 times |
|
editors |
0 |
Top Answerers
more »
Recent Hot Answers
Minimum-cut with minimum number of edgesfind the union of all min cuts of a flow network
Karger's algorithm: why does every vertex have degree at least the number of edges crossing a min cut?
Finding a minimum cut with an upper bound on the set sizes
Graph with $\Theta(2^n)$ minimum $(s, t)$-cuts
more »