{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T09:21:04Z","timestamp":1760606464270},"reference-count":5,"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":10724,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1977,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>All known methods for calculating the connection probability for two vertices of an unreliable network take time exponential in the size of the network. A method is presented for reducing network size by transforming three\u2010terminal subnetworks into Y\u2010shaped networks, thus reducing terminal degrees and possibly creating series combinations which can be reduced to a single edge. Previously defined transformations were approximate, restricted to triangles, and required perfect terminals. The transformations given here are exact, apply to any three\u2010terminal subnetwork with perfect terminals, and permit the inclusion of unreliable terminals which are incident to one external edge. In addition, transformations for reducing certain networks with directed edges, and transformations for eliminating positive failure correlations are discussed.<\/jats:p>","DOI":"10.1002\/net.3230070202","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T03:21:26Z","timestamp":1178853686000},"page":"97-111","source":"Crossref","is-referenced-by-count":42,"title":["Transformations for simplifying network reliability calculations"],"prefix":"10.1002","volume":"7","author":[{"given":"A.","family":"Rosenthal","sequence":"first","affiliation":[]},{"given":"D.","family":"Frisque","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1970.5216434"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1972.1091214"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1972.5216173"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/0132031"},{"key":"e_1_2_1_6_2","unstructured":"Rosenthal A. \u201cComputing Reliability of Complex Systems \u201dPh.D. Thesis University of California Berkeley California 1974."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230070202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230070202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T10:30:08Z","timestamp":1699785008000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230070202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1977,6]]}},"alternative-id":["10.1002\/net.3230070202"],"URL":"https:\/\/doi.org\/10.1002\/net.3230070202","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,6]]}}}