IDEAS home Printed from https://ideas.repec.org/a/eee/reensy/v193y2020ics0951832019304053.html

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

    for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. Avinash Agrawal & Richard E. Barlow, 1984. "A Survey of Network Reliability and Domination Theory," Operations Research, INFORMS, vol. 32(3), pages 478-492, June.
    4. 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.
    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. 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).
    2. Mohsen Alambardar Meybodi & Amir Goharshady & Mohammad Reza Hooshmandasl & Ali Shakiba, 2025. "Optimal blocks for maximizing the transaction fee revenue of Bitcoin miners," Journal of Combinatorial Optimization, Springer, vol. 49(1), pages 1-27, January.
    3. Alkaff, Abdullah, 2021. "Discrete time dynamic reliability modeling for systems with multistate components," Reliability Engineering and System Safety, Elsevier, vol. 209(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. Liu, Tao & Liu, Jun & Bai, Guanghan & Zhang, Junfu & Wang, Libo, 2025. "A reliability evaluation method for multi-state flow networks considering network configuration adjustment," Reliability Engineering and System Safety, Elsevier, vol. 261(C).
    2. 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.
    3. 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.
    4. Chan, Jianpeng & Papaioannou, Iason & Straub, Daniel, 2024. "Bayesian improved cross entropy method with categorical mixture models for network reliability assessment," Reliability Engineering and System Safety, Elsevier, vol. 252(C).
    5. Hans L. Bodlaender & Josse Dobben de Bruyn & Dion Gijswijt & Harry Smit, 2022. "Constructing tree decompositions of graphs with bounded gonality," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2681-2699, November.
    6. Bhaskar Ray Chaudhury & Jugal Garg & Kurt Mehlhorn & Ruta Mehta & Pranabendu Misra, 2024. "Improving Envy Freeness up to Any Good Guarantees Through Rainbow Cycle Number," Mathematics of Operations Research, INFORMS, vol. 49(4), pages 2323-2340, November.
    7. Zhang, Shuai & Bai, Guanghan & Tao, Junyong & Wang, Yang & Xu, Bei, 2025. "An algorithm to search for multi-state minimal cuts in multi-state flow networks containing state heterogeneous components," Reliability Engineering and System Safety, Elsevier, vol. 256(C).
    8. Dmitry V. Gribanov & Dmitry S. Malyshev & Panos M. Pardalos & Nikolai Yu. Zolotykh, 2025. "A new and faster representation for counting integer points in parametric polyhedra," Computational Optimization and Applications, Springer, vol. 92(3), pages 811-861, December.
    9. 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.
    10. Yeh, Wei-Chang, 2024. "A new hybrid inequality BAT for comprehensive all-level d-MP identification using minimal paths in Multistate Flow Network reliability analysis," Reliability Engineering and System Safety, Elsevier, vol. 244(C).
    11. 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.
    12. Édouard Bonnet & Sergio Cabello, 2021. "The complexity of mixed-connectivity," Annals of Operations Research, Springer, vol. 307(1), pages 25-35, December.
    13. Matheus J. Ota & Ricardo Fukasawa, 2025. "Hardness of Pricing Routes for Two-Stage Stochastic Vehicle Routing Problems with Scenarios," Operations Research, INFORMS, vol. 73(4), pages 2177-2187, July.
    14. 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.
    15. Fomin, Fedor V. & Fraigniaud, Pierre & Golovach, Petr A., 2022. "Present-biased optimization," Mathematical Social Sciences, Elsevier, vol. 119(C), pages 56-67.
    16. 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.
    17. 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.
    18. Kozyra, Paweł Marcin, 2023. "The usefulness of (d,b)-MCs and (d,b)-MPs in network reliability evaluation under delivery or maintenance cost constraints," Reliability Engineering and System Safety, Elsevier, vol. 234(C).
    19. Niu, Yi-Feng & Xiang, Hai-Yan & Xu, Xiu-Zhen, 2024. "Expected performance evaluation and optimization of a multi-distribution multi-state logistics network based on network reliability," Reliability Engineering and System Safety, Elsevier, vol. 251(C).
    20. 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).

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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.