K-terminal reliability of hierarchical networks

A class of networks called hierarchical networks is described, and it is shown how reliability can be computed efficiently in a hierarchical network. In particular, an algorithm for the K-terminal problem is described for computing the probability that a set of k nodes (k>1) can communicate through the network. The algorithm complexity is polynomial with a small degree. The exact degree depends on the distribution of the nodes that desire to communicate and the external gateways.<
>