{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T19:29:00Z","timestamp":1773084540340,"version":"3.50.1"},"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":7223,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1987,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Cut set inclusion and exclusion is a well known reliability evaluation procedure. However, many of the cut set intersection terms cancel so it can be laborious to use. In directed graphs it is shown that the number of noncancelling terms cannot exceed the number of possible ordered partitions of the set of nodes. The resulting node partition formula will still contain cancelling terms when applied to incomplete graphs. An algorithm is developed to determine the set of noncancelling terms and its application illustrated on some special classes of graphs: acyclic graphs and graphs admitting a modular decomposition.<\/jats:p>","DOI":"10.1002\/net.3230170207","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T22:17:41Z","timestamp":1178921861000},"page":"227-240","source":"Crossref","is-referenced-by-count":12,"title":["Node partition formula for directed graph reliability"],"prefix":"10.1002","volume":"17","author":[{"given":"J. A.","family":"Buzacott","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"R. M.Burstall Heuristic and decision tree methods on computers: some operational research applications. Ph.D. thesis Department of Engineering Production University of Birmingham England (1965)."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130208"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1984.5221875"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1982.5221216"},{"key":"e_1_2_1_6_2","volume-title":"Graph Theory","author":"Mayeda W.","year":"1972"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1982.5221215"},{"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":"publisher","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.3230170207","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230170207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T16:25:29Z","timestamp":1697905529000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230170207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["10.1002\/net.3230170207"],"URL":"https:\/\/doi.org\/10.1002\/net.3230170207","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}