Re:Solving the minimum cut problem for undirected graphs
by anticensor on Wednesday April 17, 2024 @04:58PM
(#40069991)
No, maximum cut is a significantly harder problem. Minimum cut, on the other hand, is equivalent to maximum flow: https://en.wikipedia.org/wiki/Max-flow_min-cut_theorem
[ Parent
| on HN ]
There are no comments on this comment yet.