In this paper, the authors present an efficient implementation for the O(mn+n2logn) time algorithm originally proposed by Nagamochi and Ibaraki for computing the minimum capacity cut of an undirected network. To enhance computation, various ideas are added so that it can contract as many edges as possible in each iteration. To evaluate the performance of the resulting implementation, the authors conducted extensive computational experiments, and compared the results with that of Padberg and Rinaldi’s algorithm, which is currently known as one of the practically fastest programs for this problem. The results indicate that our program is considerably faster than Padberg and Rinaldi’s program, and its running time is not significantly affected by the types of the networks being solved.
