This is a preview of subscription content, log in via an institution to check access.
Literature Cited
H. Frank and I. Frisch, “Analysis and design of survivable networks” IEEE Trans. Commun. Tech.,COM-18, No. 5 (October, 1970).
O. Ore, Theory of Graphs [in Russian], Nauka, Moscow (1968).
A. T. Amin and S. L. Hakimi, “Graphs with given connectivity and independence number or networks with given measures of vulnerability and survivability” IEEE Trans. Circuit Theory,CT-20, No. 1 (January, 1973).
D. Y. Kleitman, “Methods for investigating connectivity of large graphs,” IEEE Trans. Circuit Theory (May, 1969).
L. Flatta and U. G. Montanari, “A Boolean algebra method for computing the terminal reliability in a communication network,” IEEE Trans. Circuit Theory,CT-20, No. 3 (May, 1973).
H. Frank, “Survivability analysis of command and control communications networks. II,” IEEE Trans. Commun.,COM-22, No. 5 (May, 1971).
S. Bellert and G. Voznyatski, Analysis and Synthesis of Electric Networks by the Method of Structural Numbers [Russian translation], Mir, Moscow (1972).
Additional information
Translated from Kibernetika, No. 4, pp. 150–151, July–August, 1978.
Rights and permissions
About this article
Cite this article
Krapiva, A.I. An approach to determining the minimum cut-set of a graph. Cybern Syst Anal 14, 645–647 (1978). https://doi.org/10.1007/BF01069854
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069854