An exact algebraic method for computing the two‐terminal reliabilities in a network is approximated to yield an effective upper bound that can be computed in time that is polynomial in the size of the network. The result yields both a strong a priori bound and a strong a posteriori technique for improving upper bounds from other upper‐bounding methods. © 1993 by John Wiley & Sons, Inc.
ASJC Scopus subject areas
- Information Systems
- Hardware and Architecture
- Computer Networks and Communications