Abstract
A stochastic network is a deterministic graph, which is assumed to be undirected and connected. This graph can be split into two edge-disjoint through subgraphs a set of separating vertices. Separate reliability analysis is carried out for the corresponding stochastic subgraphs and the results are then combined to obtain a decomposition formula for the k -terminal reliability of the stochastic network. This formula is used to develop a general and unifying approach to network reduction. Special cases are analyzed in detail and several numerical examples are presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
