No, maximum cut is a significantly harder problem. Minimum cut, on the other han...

		anticensor on April 17, 2024 \| parent \| context \| favorite \| on: Solving the minimum cut problem for undirected gra... 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