Title :
Implementation of a factoring algorithm for reliability evaluation of undirected networks
Author :
Resende, Lucia I P
Author_Institution :
California Univ., Berkeley, CA, USA
fDate :
12/1/1988 12:00:00 AM
Abstract :
A description is given of a FORTRAN implementation of a factoring algorithm (LR-F) for reliability evaluation of undirected networks. The algorithm is used in conjunction with PolyChain, a FORTRAN program for reliability evaluation of undirected networks of a special structure via polygon-to-chain reductions. PolyChain is used as a preprocessor to reduce the size of the network. It places a constraint on the topology of the input network, requiring it to be nonseparable. The present version of PolyChain checks for this condition. In the case of separable networks a code using PolyChain as a subrouting can be used to compute the reliability of each nonseparable component and then the overall reliability of the network. A brief theoretical review of the LR-F factoring algorithm and the design and implementation of the code is presented
Keywords :
engineering computing; graph theory; reliability theory; FORTRAN implementation; LR.F algorithm; PolyChain; factoring algorithm; nonseparable component; polygon-to-chain reductions; reliability evaluation; separable networks; undirected graph; undirected networks; Algorithm design and analysis; Computer network reliability; Computer networks; Data structures; Maintenance; Network topology; Probability; Reliability engineering; Reliability theory; Testing;
Journal_Title :
Reliability, IEEE Transactions on
