Article PDF
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
Literature Cited
V. D. Podderyugin, “An algorithm for finding the edge connectivity of graphs,” Vopr. Kibern., No. 2, 136 (1973).
E. A. Timoffev, “An algorithm for constructing minimax k-connected oriented graphs,” Kibernetika, No. 2, 109 (1982).
L. R. Ford, Jr., and D. R. Falkerston, Flows in Networks, Princeton Univ. Press (1962).
E. A. Dinits, A. V. Karzanov, and M. V. Lomonosov, “On the structure of a system of minimal edge cuts of a graph,” in: Investigations in Discrete Optimization [in Russian], Nauka, Moscow (1976), pp. 290–306.
G. M. Adel'son-Vel'skii, E. A. Dinits, and A. V. Karzanov, Flow Algorithms [in Russian], Nauka, Moscow (1976).
A. Aho, J. Hopcroft, and J. Ulman, Design and Analysis of Computing Algorithms [Russian translation], Mir, Moscow (1979).
Additional information
Translated from Kibernetika, No. 2, pp. 8–12, March–April, 1986.
Rights and permissions
About this article
Cite this article
Karzanov, A.V., Timofeev, E.A. Efficient algorithm for finding all minimal edge cuts of a nonoriented graph. Cybern Syst Anal 22, 156–162 (1986). https://doi.org/10.1007/BF01074775
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01074775