A new algorithm for computing the overall network reliability

The paper proposes an algorithm for computing the overall network reliability based on elementary tree transformations. It can directly find out the set of disjoint trees in a network graph without additional tree-disjointing operations. Such a derived set of disjoint trees contains the same number of trees as does the network graph and therefore is of the simplest and optimal form. This algorithm is effective in computer implementation.