Efficient algorithms for reliability analysis of planar networks - a survey
Authors:
- 1 August 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 35 (3) , 252-259
Abstract
We survey some recent polynomial-time algorithms for the exact computation of network reliability. The algorithms apply to several classes of planar networks, which include series-parallel, inner-cycle-free, inner-four-cycle-free and planar cube-free. We describe these classes and discuss the related polynomial algorithms for computing their reliability.Keywords
This publication has 16 references indexed in Scilit:
- Network Reliability and Inner-Four-Cycle-Free GraphsMathematics of Operations Research, 1986
- Network reliability analysis using 2‐connected digraph reductionsNetworks, 1985
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is ConnectedSIAM Journal on Computing, 1983
- Halin graphs and the travelling salesman problemMathematical Programming, 1983
- Steiner trees in probabilistic networksMicroelectronics Reliability, 1983
- System Effectiveness Evaluation Using Star and Delta TransformationsIEEE Transactions on Reliability, 1981
- Complexity of network reliability computationsNetworks, 1980
- An Algorithm for the Reliability Evaluation of Redundant NetworksIEEE Transactions on Reliability, 1970
- Topology of series-parallel networksJournal of Mathematical Analysis and Applications, 1965
- Reliable circuits using less reliable relaysJournal of the Franklin Institute, 1956