An algorithm for the computation of computer network reliability in linear-time

The best known solution methods for network reliability problems are of exponential time complexity. This exponential behavior can render even moderately sized problems computationally intractable owing to the enormous amount of time required to generate a solution. To render such problems manageable, a bounding algorithm that provides upper and lower bounds for the source-to-terminal reliability of an arbitrary network has been developed. A unique feature of this bounding algorithm is that it possesses linear time complexity when the maximum indegree of all network nodes is limited