Skip to main content
SpringerLink
Log in

Implementing an efficient minimum capacity cut algorithm

  • Published:
Mathematical Programming Submit manuscript

Abstract

In this paper, we present an efficient implementation of theO(mn + n 2 logn) time algorithm originally proposed by Nagamochi and Ibaraki (1992) 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, we conducted extensive computational experiments, and compared the results with that of Padberg and Rinaldi's algorithm (1990), 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. L. Ford and D. Fulkerson,Flows in Networks (Princeton University Press, 1962).

  2. A. Frank, T. Ibaraki and H. Nagamochi, “On sparse subgraphs preserving connectivity properties,”Journal on Graph Theory 17 (1993) 275–281.

    Google Scholar 

  3. A. Goldberg and T. Tarjan, “A new approach to the maximum flow problem,”J ACM 35 (1988) 921–940.

    Google Scholar 

  4. R. Gomory and T. Hu, “Multi-terminal network flows,”SIAM Journal on Applied Mathematics 9 (1961) 551–570.

    Google Scholar 

  5. J. Hao and J.B. Orlin, “A faster algorithm for finding the minimum cut in a graph,”Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, Orlando, Florida (1992) 165–174.

  6. D.V. Karger and C. Stein, “AnÕ(n2) algorithm for minimum cuts,”Proc. 25th ACM Symp. Theory of Computing, San Diego, California (1993) 757–765.

  7. H. Nagamochi and T. Ibaraki, “A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph,”Algorithmica 7 (1992) 583–596.

    Google Scholar 

  8. H. Nagamochi and T. Ibaraki, “Computing edge-connectivity in multigraphs and capacitated graphs,”SIAM Journal on Discrete Mathematics 5 (1992) 54–66.

    Google Scholar 

  9. M. Padberg and G. Rinaldi, “An efficient algorithm for the minimum capacity cut problem,”Mathematical Programming 47 (1990) 19–36.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, 606-01, Kyoto, Japan

    Hiroshi Nagamochi, Tadashi Ono & Toshihide Ibaraki

Authors
  1. Hiroshi Nagamochi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tadashi Ono
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Toshihide Ibaraki
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Corresponding author.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nagamochi, H., Ono, T. & Ibaraki, T. Implementing an efficient minimum capacity cut algorithm. Mathematical Programming 67, 325–341 (1994). https://doi.org/10.1007/BF01582226

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01582226

Keywords

Search

Navigation