Generation of K-Trees of undirected graphs
- 1 June 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 46 (2) , 208-211
- https://doi.org/10.1109/24.589948
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A simple method for generating K-trees of a networkMicroelectronics Reliability, 1993
- The Complexity of the Residual Node Connectedness Reliability ProblemSIAM Journal on Computing, 1991
- Efficient algorithms for computing the reliability of permutation and interval graphsNetworks, 1990
- SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset MethodsIEEE Transactions on Computers, 1987
- An Improved Abraham-Method for Generating Disjoint SumsIEEE Transactions on Reliability, 1987
- 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
- An Improved Algorithm for Network ReliabilityIEEE Transactions on Reliability, 1979
- A Simple Method for Reliability Evaluation of a Communication SystemIEEE Transactions on Communications, 1975