A decomposition algorithm for network reliability evaluation
Authors:
- 18 February 2000
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 65 (1-3) , 141-156
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Factoring and reductions for networks with imperfect verticesIEEE Transactions on Reliability, 1991
- Triconnected decomposition for computingK-terminal network reliabilityNetworks, 1989
- A practical implementation of the factoring theorem for network reliabilityIEEE Transactions on Reliability, 1988
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel NetworksSIAM Journal on Computing, 1985
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- Network reliability and the factoring theoremNetworks, 1983
- Computing the Reliability of Complex NetworksSIAM Journal on Applied Mathematics, 1977
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973