Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

An approach to determining the minimum cut-set of a graph

  • 45 Accesses

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

Literature Cited

  1. 1.

    H. Frank and I. Frisch, “Analysis and design of survivable networks” IEEE Trans. Commun. Tech.,COM-18, No. 5 (October, 1970).

  2. 2.

    O. Ore, Theory of Graphs [in Russian], Nauka, Moscow (1968).

  3. 3.

    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).

  4. 4.

    D. Y. Kleitman, “Methods for investigating connectivity of large graphs,” IEEE Trans. Circuit Theory (May, 1969).

  5. 5.

    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).

  6. 6.

    H. Frank, “Survivability analysis of command and control communications networks. II,” IEEE Trans. Commun.,COM-22, No. 5 (May, 1971).

  7. 7.

    S. Bellert and G. Voznyatski, Analysis and Synthesis of Electric Networks by the Method of Structural Numbers [Russian translation], Mir, Moscow (1972).

Download references

Additional information

Translated from Kibernetika, No. 4, pp. 150–151, July–August, 1978.

Rights and permissions

Reprints 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

Download citation

Keywords

  • Operating System
  • Artificial Intelligence
  • System Theory