Accession Number : ADA185501

Title :   Algebraic Aspects of Computing Network Reliability.

Descriptive Note : Technical rept.,

Corporate Author : CLEMSON UNIV SC DEPT OF MATHEMATICAL SCIENCES

Personal Author(s) : Shier, D R

PDF Url : ADA185501

Report Date : Sep 1986

Pagination or Media Count : 24

Abstract : The problem of calculating the two-terminal reliability of a network having edges that fail randomly and independently is known to be NP-hard, even in the case of directed acyclic networks. This paper discusses an iterative technique that provides at each iteration both upper and lower bounds on the exact reliability value. These bounds are shown to converge to the exact answer for the case of acyclic networks. Computational results indicate that for certain classes of graphs these bounds converge rapidly and provide excellent approximations to the true network reliability. (Author)

Descriptors :   *COMPUTATIONS, *NETWORK ANALYSIS(MANAGEMENT), GRAPHS, ITERATIONS, NETWORKS, RELIABILITY, ALGORITHMS

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE