The Ordering of Terms in Cut-based Recursive Disjoint Products

In the disjoint products version of the cut-based method of reliability analysis of graphs it is necessary to determine the order in which the cuts are to be considered. The usual approach has been to order them in terms of the number of arcs in the cut, with the cuts with the least number of arcs considered first. However, the reliability formula can be simplified if the cuts are considered in an order which is obtained by considering the node partition associated with each cut. There does not seem to be any such ordering of the paths that will enable a corresponding simplification of the minpath formula.