Abstract
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).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, T. G. Szymanski, M. Yannakakis, “Sorting the Cartesian Product”, Proc. Princeton Conf. on Information Sciences, 1980.
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.
P. Elias, A. Feinstein, C. E. Shannon, “Note on Maximum Flow on a Network”, IRE Trans. Inform. Theory, pp. 117–119, 1956.
L. R. Ford, D. R. Fulkerson, Flows in Networks, Princeton University Press, 1962.
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.
A. V. Karzanov, E. A. Timofeev, “Efficient Algorithms for Finding All Minimal Edge Cuts of a Nonoriented Graph”, Cybernetics, pp. 156–162, 1986.
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.
D. Naor, V. V. Vazirani, “Representing and Enumerating Edge Connectivity Cuts in RNC”, Proc. 2nd Workshop on Algorithms and Data Structures, 1991.
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.
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.
J. W. Suurballe, “Note on Finding All Minimum Cuts”, Bell Laboratories Technical Memorandum, 1974.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vazirani, V.V., Yannakakis, M. (1992). Suboptimal cuts: Their enumeration, weight and number. In: Kuich, W. (eds) Automata, Languages and Programming. ICALP 1992. Lecture Notes in Computer Science, vol 623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55719-9_88
Download citation
DOI: https://doi.org/10.1007/3-540-55719-9_88
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55719-7
Online ISBN: 978-3-540-47278-0
eBook Packages: Springer Book Archive