Node partition formula for directed graph reliability

DOI10.1002/NET.3230170207MaRDI QIDQ3789314zbMATH OpenOpenAlexFDO

Authors John A. Buzacott

Publication date 1987

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230170207

zbMATH Keywords

directed graphsreliability evaluationacyclic graphsnode partitionnoncancelling terms

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• On reliability of graphs with node failures
• On the split reliability of graphs
• scientific article; zbMATH DE number 913340
• scientific article; zbMATH DE number 867686
• Reliability of directed networks using the factoring theorem
• Computing the \(K\)-terminal reliability of directed path graphs
• scientific article; zbMATH DE number 3924818
• The shape of node reliability
• scientific article; zbMATH DE number 1332751

Cited in

(4)

• System Reliability Analysis in the Presence of Dependent Component Failures
• The Ordering of Terms in Cut-based Recursive Disjoint Products
• Cut-Set Intersections and Node Partitions
• Network reliability: Heading out on the highway

This page was built for publication: Node partition formula for directed graph reliability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789314)