IDEAS home Printed from https://ideas.repec.org/a/eee/reensy/v93y2008i7p1018-1024.html
   My bibliography  Save this article

An improved algorithm for searching all minimal cuts in modified networks

Author

Listed:
  • Yeh, Wei-Chang

Abstract

A modified network is an updated network after inserting a branch string (a special path) between two nodes in the original network. Modifications are common for network expansion or reinforcement evaluation and planning. The problem of searching all minimal cuts (MCs) in a modified network is discussed and solved in this study. The existing best-known methods for solving this problem either needed extensive comparison and verification or failed to solve some special but important cases. Therefore, a more efficient, intuitive and generalized method for searching all MCs without an extensive research procedure is proposed. In this study, we first develop an intuitive algorithm based upon the reformation of all MCs in the original network to search for all MCs in a modified network. Next, the correctness of the proposed algorithm will be analyzed and proven. The computational complexity of the proposed algorithm is analyzed and compared with the existing best-known methods. Finally, two examples illustrate how all MCs are generated in a modified network using the information of all of the MCs in the corresponding original network.

Suggested Citation

  • Yeh, Wei-Chang, 2008. "An improved algorithm for searching all minimal cuts in modified networks," Reliability Engineering and System Safety, Elsevier, vol. 93(7), pages 1018-1024.
    • Handle: RePEc:eee:reensy:v:93:y:2008:i:7:p:1018-1024
    DOI: 10.1016/j.ress.2007.05.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0951832007001421
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ress.2007.05.003?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Yeh, Wei-Chang, 2006. "A simple algorithm to search for all MCs in networks," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1694-1705, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yeh, Wei-Chang, 2020. "A new method for verifying d-MC candidates," Reliability Engineering and System Safety, Elsevier, vol. 204(C).
    2. Miroslav Kvassay & Vitaly Levashenko & Elena Zaitseva, 2016. "Analysis of minimal cut and path sets based on direct partial Boolean derivatives," Journal of Risk and Reliability, , vol. 230(2), pages 147-161, April.
    3. Lin, Yi-Kuei & Yeh, Cheng-Ta, 2011. "Maximal network reliability for a stochastic power transmission network," Reliability Engineering and System Safety, Elsevier, vol. 96(10), pages 1332-1339.
    4. Vaibhav Gaur & Om Prakash Yadav & Gunjan Soni & Ajay Pal Singh Rathore, 2021. "A literature review on network reliability analysis and its engineering applications," Journal of Risk and Reliability, , vol. 235(2), pages 167-181, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jane, Chin-Chia & Laih, Yih-Wenn, 2010. "A dynamic bounding algorithm for approximating multi-state two-terminal reliability," European Journal of Operational Research, Elsevier, vol. 205(3), pages 625-637, September.
    2. Yeh, Wei-Chang & Tan, Shi-Yi & Zhu, Wenbo & Huang, Chia-Ling & Yang, Guang-yi, 2022. "Novel binary addition tree algorithm (BAT) for calculating the direct lower-bound of the highly reliable binary-state network reliability," Reliability Engineering and System Safety, Elsevier, vol. 223(C).
    3. Yeh, Wei-Chang, 2021. "Novel binary-addition tree algorithm (BAT) for binary-state network reliability problem," Reliability Engineering and System Safety, Elsevier, vol. 208(C).
    4. Yeh, Wei-Chang, 2023. "QB-II for evaluating the reliability of binary-state networks," Reliability Engineering and System Safety, Elsevier, vol. 230(C).
    5. Paweł Marcin Kozyra, 2020. "Analysis of minimal path and cut vectors in multistate monotone systems and use it for detection of binary type multistate monotone systems," Journal of Risk and Reliability, , vol. 234(5), pages 686-695, October.
    6. Yeh, Wei-Chang, 2021. "Novel Algorithm for Computing All-Pairs Homogeneity-Arc Binary-State Undirected Network Reliability," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    7. Yeh, Wei-Chang, 2020. "A new method for verifying d-MC candidates," Reliability Engineering and System Safety, Elsevier, vol. 204(C).
    8. Yeh, Wei-Chang, 2021. "A quick BAT for evaluating the reliability of binary-state networks," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    9. Reed, Sean & Löfstrand, Magnus & Andrews, John, 2019. "An efficient algorithm for computing exact system and survival signatures of K-terminal network reliability," Reliability Engineering and System Safety, Elsevier, vol. 185(C), pages 429-439.
    10. Yeh, Wei-Chang & Du, Chia-Ming & Tan, Shi-Yi & Forghani-elahabad, Majid, 2023. "Application of LSTM based on the BAT-MCS for binary-state network approximated time-dependent reliability problems," Reliability Engineering and System Safety, Elsevier, vol. 235(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:reensy:v:93:y:2008:i:7:p:1018-1024. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/reliability-engineering-and-system-safety .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.