Skip to main content
SpringerLink
Log in

A method of constructing minimal failure cuts

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The paper describes a method for constructing minimal failure cuts in a graph with a user. The method leads to an efficient directed search algorithm.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature Cited

  1. N. Yu. Kuznetsov, “Computing the availability of a system with repair by analytical-statistical method,” Kibernetika, No. 5, 95–101 (1985).

    Google Scholar 

  2. M. S. Samad, “An efficient algorithm for simultaneously deducing minimal path as well as cuts of a communicational network,” Microelectron. Reliab.,27, No. 3, 437–441 (1987).

    Google Scholar 

  3. V. K. Bansal, K. B. Misra, and M. P. Jain, “Minimal pathset and minimal cutsets using search technique” Microelectron. Reliab.,22, No. 6, 1067–1075 (1982).

    Google Scholar 

Download references

Authors
  1. D. A. Alekseev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 8–10, 31, May–June, 1991.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alekseev, D.A. A method of constructing minimal failure cuts. Cybern Syst Anal 27, 320–323 (1991). https://doi.org/10.1007/BF01068311

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01068311

Keywords

Search

Navigation