A simple method for generating K-trees of a network
- 1 July 1993
- journal article
- Published by Elsevier in Microelectronics Reliability
- Vol. 33 (9) , 1241-1244
- https://doi.org/10.1016/0026-2714(93)90124-h
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- An efficient algorithm for computing global reliability of a networkIEEE Transactions on Reliability, 1988
- Factoring Algorithms for Computing K-Terminal Network ReliabilityIEEE Transactions on Reliability, 1986
- A factoring algorithm using polygon‐to‐chain reductions for computing K‐terminal network reliabilityNetworks, 1985
- Network reliability and the factoring theoremNetworks, 1983
- Reliability Evaluation in Computer-Communication NetworksIEEE Transactions on Reliability, 1981
- Computing Network ReliabilityOperations Research, 1979
- Matroids and a Reliability Analysis ProblemMathematics of Operations Research, 1979
- An algorithm for enumerating all simple paths in a communication networkMicroelectronics Reliability, 1979
- Bayesian Decomposition Method for Computing the Reliability of an Oriented NetworkIEEE Transactions on Reliability, 1976
- An Algorithm for the Reliability Evaluation of Redundant NetworksIEEE Transactions on Reliability, 1970