A recursive algorithm for directed‐graph reliability

Publisher Website
Google Scholar
Abstract
It is shown that the recursive algorithm for determining the reliability measures relating to the connection of nodes in an undirected graph can also be applied to directed graphs with no increase in the computational requirements. The resulting algorithm is compared with a number of other directed‐graph reliability algorithms and is shown to require, on complete graphs, significantly fewer multiplications than any existing algorithm.