An efficient algorithm for the minimum capacity cut problem (Q922927): Difference between revisions

An algorithm to find a minimum cut in a network is presented. The complexity of this algorithm is \(O(n^ 4)\), the same as that given by \textit{R. E. Gomory} and \textit{T. C. Hu} [J. SIAM 9, 551-570 (1961; Zbl 0112.124)]. But, according to the author, this algorithm is easier to implement and empirically superior to the standard algorithm.