Comments on "A Fast Recursive Algorithm to Calculate the Reliability of a Communication Network"

In the above paper, a procedure is described that determines the probability that all communication paths between two nodes in a network are interrupted. The problem is solved by recursively splitting the original problem into smaller subproblems. In this correspondence, we demonstrate that in certain classes of networks identical subproblems have to be solved several times. Thus the efficiency of the algorithm can be further improved by storing the subnetworks and the results of their evaluation.