{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:07:54Z","timestamp":1699834074191},"reference-count":14,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":10632,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1977,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The calculation of terminal reliability in other than simple series\u2010parallel networks takes time exponential in the size of the network. A method is presented for reducing network size by decomposing the network into subnetworks. Terminal reliability is obtained from calculations in the subnetworks. As the efficiency of the method depends on the network decomposition, some simple rules for selecting \u2018good\u2019 decompositions are presented.<\/jats:p><jats:p>The method yields approximate values of terminal reliability. In sparse networks, however, the approximation is very satisfactory. Further, if the network decomposition satisfies certain conditions, exact values are obtained. Although the method assumes undirected links and perfectly reliable nodes, it can be easily extended to include directed links and failing nodes.<\/jats:p>","DOI":"10.1002\/net.3230070304","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T03:48:18Z","timestamp":1178855298000},"page":"227-246","source":"Crossref","is-referenced-by-count":4,"title":["A fast algorithm for reliability calculations in sparse networks"],"prefix":"10.1002","volume":"7","author":[{"given":"N.","family":"Spyratos","sequence":"first","affiliation":[]},{"given":"A.","family":"Bowen","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"Banerjee S. K.andK.Rajamani \u201cParametric Representation of Probability in Two Dimensions \u2010 A New Approach in System Reliability Evaluation \u201dIEEETrans on Reliability R\u201021 February1972 pp.56\u201360.","DOI":"10.1109\/TR.1972.5216173"},{"key":"e_1_2_1_3_2","volume-title":"Renewal Theory","author":"Cox D. R.","year":"1962"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"DeMercado J. S.SpyratosandB. A.Bowen \u201cA Method for Calculating Network Reliability \u201dIEEE Trans on Reliability R\u201025 2 June1976 pp.71\u201376.","DOI":"10.1109\/TR.1976.5214981"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040303"},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"Fratta L.andU.Montanari \u201cA Boolean Algebra Method for Computing the Terminal Reliability in a Communication Network \u201dIEEE Trans on Circuit Theory CT\u201020 May1973 pp.203\u2013211.","DOI":"10.1109\/TCT.1973.1083657"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"Hansler E. \u201cA Fast Recursive Algorithm to Calculate the Reliability of a Communication Network \u201dIEEE Trans on Commun. CCM\u201020 June1972 pp.637\u2013640.","DOI":"10.1109\/TCOM.1972.1091159"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040202"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"Jensen P. A.andM.Bellmore \u201cAn Algorithm to Determine the Reliability of a Complex System \u201dIEEE Trans on Reliability R\u201018 November1969 pp.169\u2013174.","DOI":"10.1109\/TR.1969.5216346"},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"Mine H. \u201cReliability of Physical Systems \u201dIRE Trans on Circuit Theory CT\u20106 1959 pp.138\u2013151.","DOI":"10.1109\/TCT.1959.1086604"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"Misra K. B. \u201cAn Algorithm for the Reliability Evaluation of Redundant Networks \u201dIEEE Trans on Reliability R\u201019 November1960 pp.146\u2013151.","DOI":"10.1109\/TR.1970.5216434"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070202"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1137\/0132031"},{"key":"e_1_2_1_14_2","unstructured":"Spyratos N. \u201cDecomposition Techniques for Computing Reliability Measures in Large Systems \u201d Doctoral Dissertation 1975 Systems Engineering Department Carleton University Ottawa Canada."},{"key":"e_1_2_1_15_2","doi-asserted-by":"crossref","unstructured":"Aggarwal K. K. J. S.GuptaandK. B.Misra \u201cA Simple Method for Reliability Evaluation of a Communication System \u201dIEEE Trans on Comm. May1975 pp.563\u2013566.","DOI":"10.1109\/TCOM.1975.1092838"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230070304","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230070304","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T09:48:53Z","timestamp":1699782533000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230070304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1977,9]]}},"alternative-id":["10.1002\/net.3230070304"],"URL":"https:\/\/doi.org\/10.1002\/net.3230070304","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,9]]}}}