{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T00:33:32Z","timestamp":1698021212600},"reference-count":9,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":8533,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1983,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>It is shown that the recursive algorithm for determining the reliability measures relating to the connection of nodes in an undirected graph can also be applied to directed graphs with no increase in the computational requirements. The resulting algorithm is compared with a number of other directed\u2010graph reliability algorithms and is shown to require, on complete graphs, significantly fewer multiplications than any existing algorithm.<\/jats:p>","DOI":"10.1002\/net.3230130208","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T15:18:38Z","timestamp":1178896718000},"page":"241-246","source":"Crossref","is-referenced-by-count":10,"title":["A recursive algorithm for directed\u2010graph reliability"],"prefix":"10.1002","volume":"13","author":[{"given":"J. A.","family":"Buzacott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.27.4.823"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100206"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100404"},{"key":"e_1_2_1_5_2","unstructured":"J. A.BuzacottandS. K.Chang The node partition formula for network reliability. Unpublished paper Department of Industrial Engineering University of Toronto 1981."},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"L.FrattaandU.Montanari A Boolean algebra method for computing the terminal reliability in a communication network.IEEE Trans. Circuit TheoryCT\u201020 (1973)203\u2013211.","DOI":"10.1109\/TCT.1973.1083657"},{"key":"e_1_2_1_7_2","volume-title":"Reliability and Fault Tree Analysis: Theoretical and Applied Aspects of System Reliability and Safety Assessment","author":"Murchland T. D.","year":"1975"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110405"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"A.SatyanarayanaandA.Prabhahar New topological formula and rapid algorithm for reliability of complex networks.IEEE Trans. Reliab.R\u201027 (1978)82\u2013100.","DOI":"10.1109\/TR.1978.5220266"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230080307"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230130208","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230130208","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T09:16:47Z","timestamp":1697793407000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230130208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,6]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,6]]}},"alternative-id":["10.1002\/net.3230130208"],"URL":"https:\/\/doi.org\/10.1002\/net.3230130208","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,6]]}}}