Suboptimal cuts: Their enumeration, weight and number

Extended abstract
  • Vijay V. Vazirani
  • Mihalis Yannakakis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 623)


We present (1) an algorithm that enumerates the cuts of a network by increasing weight with polynomial delay, and (2) an algorithm that computes the k-th minimum weight in polynomial time for fixed k We also show that in the case of undirected networks there are only polynomially many cuts that have the k-th minimum weight for any fixed k (whereas directed networks can have exponentially many different minimum cuts).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ASY]
    A. V. Aho, T. G. Szymanski, M. Yannakakis, “Sorting the Cartesian Product”, Proc. Princeton Conf. on Information Sciences, 1980.Google Scholar
  2. [DKL]
    E. A. Dinits, A. V. Karzanov, M. V. Lomosonov, “On the Structure of a Family of Minimal Weighted Cuts in a Graph”, Studies in Discrete Optimization [in Russian], A. A. Fridman (Ed.), Nauka, Moscow, pp. 290–306, 1976.Google Scholar
  3. [EFS]
    P. Elias, A. Feinstein, C. E. Shannon, “Note on Maximum Flow on a Network”, IRE Trans. Inform. Theory, pp. 117–119, 1956.Google Scholar
  4. [FF]
    L. R. Ford, D. R. Fulkerson, Flows in Networks, Princeton University Press, 1962.Google Scholar
  5. [K]
    A. Kanevsky, “On the Number of Minimum Size Separating Vertex Sets in a Graph and How to Find All of Them”, Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms, 1990.Google Scholar
  6. [KT]
    A. V. Karzanov, E. A. Timofeev, “Efficient Algorithms for Finding All Minimal Edge Cuts of a Nonoriented Graph”, Cybernetics, pp. 156–162, 1986.Google Scholar
  7. [L]
    E. L. Lawler, “A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and its Application to the Shortest Path Problem”, Management Science, 18(7), pp. 401–405, 1972.Google Scholar
  8. [NV]
    D. Naor, V. V. Vazirani, “Representing and Enumerating Edge Connectivity Cuts in RNC”, Proc. 2nd Workshop on Algorithms and Data Structures, 1991.Google Scholar
  9. [PQ]
    J. C. Picard, M. Queyrane, “On the Structure of All Minimum Cuts in a Network and Applications”, Mathematical Programming Study 13, pp. 8–16, 1980.Google Scholar
  10. [PB]
    S. Provan, O. Ball, “The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected”, SIAM J. on Computing, 12(4), pp. 777–788, 1983.CrossRefGoogle Scholar
  11. [S]
    J. W. Suurballe, “Note on Finding All Minimum Cuts”, Bell Laboratories Technical Memorandum, 1974.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Vijay V. Vazirani
    • 1
  • Mihalis Yannakakis
    • 2
  1. 1.Indian Institute of TechnologyNew DelhiIndia
  2. 2.AT&T Bell LaboratoriesMurray Hill

Personalised recommendations