Skip to Main Content
A related paper provides an algorithm to compute the reliability of an undirected network. The algorithm exploits the decomposition tree of the network derived from decomposing the network graph into its triconnected components. This paper extends the algorithm to apply to reliability problems involving directed networks. Details are presented which specialize the algorithm to apply to the problems of 2-terminal communication, transportation flow feasibility, and path-length feasibility.