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

An efficient algorithm for computing network reliability in small treewidth

Author

Listed:
  • Goharshady, Amir Kafshdar
  • Mohammadi, Fatemeh

Abstract

We consider the classic problem of Network Reliability. A network is given together with a source vertex, one or more target vertices, and probabilities assigned to each of the edges. Each edge of the network is operable with its associated probability and the problem is to determine the probability of having at least one source-to-target path that is entirely composed of operable edges. This problem is known to be NP-hard.

Suggested Citation

  • Goharshady, Amir Kafshdar & Mohammadi, Fatemeh, 2020. "An efficient algorithm for computing network reliability in small treewidth," Reliability Engineering and System Safety, Elsevier, vol. 193(C).
    • Handle: RePEc:eee:reensy:v:193:y:2020:i:c:s0951832019304053
    DOI: 10.1016/j.ress.2019.106665
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0951832019304053
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ress.2019.106665?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. Avinash Agrawal & Richard E. Barlow, 1984. "A Survey of Network Reliability and Domination Theory," Operations Research, INFORMS, vol. 32(3), pages 478-492, June.
    2. Renhua Li & Leonie U Hempel & Tingbo Jiang, 2015. "A Non-Parametric Peak Calling Algorithm for DamID-Seq," PLOS ONE, Public Library of Science, vol. 10(3), pages 1-12, March.
    3. J. Scott Provan & Michael O. Ball, 1984. "Computing Network Reliability in Time Polynomial in the Number of Cuts," Operations Research, INFORMS, vol. 32(3), pages 516-526, June.
    4. Yeh, Wei-Chang & Bae, Changseok & Huang, Chia-Ling, 2015. "A new cut-based algorithm for the multi-state flow network reliability problem," Reliability Engineering and System Safety, Elsevier, vol. 136(C), pages 1-7.
    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. Alkaff, Abdullah, 2021. "Discrete time dynamic reliability modeling for systems with multistate components," Reliability Engineering and System Safety, Elsevier, vol. 209(C).
    2. Forghani-elahabad, Majid & Yeh, Wei-Chang, 2022. "An improved algorithm for reliability evaluation of flow networks," Reliability Engineering and System Safety, Elsevier, vol. 221(C).

    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. Zhang, Chi & Ramirez-Marquez, José Emmanuel & Wang, Jianhui, 2015. "Critical infrastructure protection using secrecy – A discrete simultaneous game," European Journal of Operational Research, Elsevier, vol. 242(1), pages 212-221.
    2. Carlos V. G. C. Lima & Dieter Rautenbach & Uéverton S. Souza & Jayme L. Szwarcfiter, 2022. "On the computational complexity of the bipartizing matching problem," Annals of Operations Research, Springer, vol. 316(2), pages 1235-1256, September.
    3. Zarezadeh, S. & Asadi, M. & Balakrishnan, N., 2014. "Dynamic network reliability modeling under nonhomogeneous Poisson processes," European Journal of Operational Research, Elsevier, vol. 232(3), pages 561-571.
    4. Ramirez-Marquez, Jose E. & Rocco, Claudio M. & Gebre, Bethel A. & Coit, David W. & Tortorella, Michael, 2006. "New insights on multi-state component criticality and importance," Reliability Engineering and System Safety, Elsevier, vol. 91(8), pages 894-904.
    5. Bai, Guanghan & Zuo, Ming J. & Tian, Zhigang, 2015. "Search for all d-MPs for all d levels in multistate two-terminal networks," Reliability Engineering and System Safety, Elsevier, vol. 142(C), pages 300-309.
    6. Chi Zhang & Jose Ramirez-Marquez, 2013. "Protecting critical infrastructures against intentional attacks: a two-stage game with incomplete information," IISE Transactions, Taylor & Francis Journals, vol. 45(3), pages 244-258.
    7. Niu, Yi-Feng & Gao, Zi-You & Lam, William H.K., 2017. "A new efficient algorithm for finding all d-minimal cuts in multi-state networks," Reliability Engineering and System Safety, Elsevier, vol. 166(C), pages 151-163.
    8. 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).
    9. Jane, Chin-Chia & Yuan, John, 2001. "A sum of disjoint products algorithm for reliability evaluation of flow networks," European Journal of Operational Research, Elsevier, vol. 131(3), pages 664-675, June.
    10. Cancela, Héctor & Petingi, Louis, 2007. "Properties of a generalized source-to-all-terminal network reliability model with diameter constraints," Omega, Elsevier, vol. 35(6), pages 659-670, December.
    11. Li, Jian & Dueñas-Osorio, Leonardo & Chen, Changkun & Shi, Congling, 2016. "Connectivity reliability and topological controllability of infrastructure networks: A comparative assessment," Reliability Engineering and System Safety, Elsevier, vol. 156(C), pages 24-33.
    12. 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).
    13. Navarro, Jorge & Rychlik, Tomasz, 2010. "Comparisons and bounds for expected lifetimes of reliability systems," European Journal of Operational Research, Elsevier, vol. 207(1), pages 309-317, November.
    14. Niu, Yi-Feng & Gao, Zi-You & Lam, William H.K., 2017. "Evaluating the reliability of a stochastic distribution network in terms of minimal cuts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 100(C), pages 75-97.
    15. Yeh, Wei-Chang & Hao, Zhifeng & Forghani-elahabad, Majid & Wang, Gai-Ge & Lin, Yih-Lon, 2021. "Novel Binary-Addition Tree Algorithm for Reliability Evaluation of Acyclic Multistate Information Networks," Reliability Engineering and System Safety, Elsevier, vol. 210(C).
    16. 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.
    17. Van Bang Le & Sheng-Lung Peng, 2018. "On the complete width and edge clique cover problems," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 532-548, August.
    18. Yeh, Wei-Chang, 2020. "A new method for verifying d-MC candidates," Reliability Engineering and System Safety, Elsevier, vol. 204(C).
    19. Jorge Navarro, 2016. "Stochastic comparisons of generalized mixtures and coherent systems," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 150-169, March.
    20. Wei, Wei & Hu, Qiuyuan & Zhang, Qinghui, 2024. "Improving node connectivity by optimized dual tree-based effective node consolidation," Reliability Engineering and System Safety, Elsevier, vol. 242(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:193:y:2020:i:c:s0951832019304053. 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.