IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v32y1984i3p516-526.html
   My bibliography  Save this article

Computing Network Reliability in Time Polynomial in the Number of Cuts

Author

Listed:
  • J. Scott Provan

    (National Bureau of Standards, Washington, D. C. and University of North Carolina, Chapel Hill, North Carolina)

  • Michael O. Ball

    (University of Maryland, College Park, Maryland)

Abstract

We present a new algorithm that computes the probability that there is an operating path from a node s to a node t in a stochastic network. The computation time of this algorithm is bounded by a polynomial in the number of ( s , t )-cuts in the network. We also examine the complexity of other connectedness reliability problems with respect to the number of cutsets and pathsets in the network. These problems are distinguished as either having algorithms that are polynomial in the number of such sets, or having no such algorithms unless P = NP .

Suggested Citation

  • 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.
    • Handle: RePEc:inm:oropre:v:32:y:1984:i:3:p:516-526
    DOI: 10.1287/opre.32.3.516
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.32.3.516
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.32.3.516?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
    ---><---

    Citations

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


    Cited by:

    1. Grit Claßen & Arie M. C. A. Koster & David Coudert & Napoleão Nepomuceno, 2014. "Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 893-909, November.
    2. 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.
    3. 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).
    4. Sharma, Megha & Ghosh, Diptesh, 2009. "Computing the probability mass function of the maximum flow through a reliable network," IIMA Working Papers WP2009-10-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    5. 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.

    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:inm:oropre:v:32:y:1984:i:3:p:516-526. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.