Generation of K-trees of undirected graphs

IEEE Transactions on Reliability

Volumn 46, Issue 2, 1997, Pages 208-211

  Patvardhan, C ^a   Prasad, V C ^a   Prem Pyara, V ^a  

^a

^b India

Author keywords

Algorithm; Enumeration; K tree; Undirected graph

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; POLYNOMIALS; RELIABILITY; TREES (MATHEMATICS);

K-TREES; UNDIRECTED GRAPHS;

RELIABILITY THEORY;

EID: 0031170712     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/24.589948     Document Type: Article

References (14)

1. K.B. Misra, "An algorithm for reliability evaluation of redundant networks", IEEE Trans. Reliability, vol R-19, 1970, pp 146-151.
2. H. Nakazawa, "Bayesian decomposition method for computing reliability of an oriented network", IEEE Trans. Reliability, vol R-25, 1976, pp 77-80.
3. A. Satyanarayana, M.K. Chang, "Network reliability and factoring theorem", Networks, vol 13, 1983, pp 107-120.
4. R. K. Wood, "A factoring theorem using polygons to chains reduction for computing K-terminal reliability", Networks, vol 15, 1985, pp 173-190.
5. R.K. Wood, "Factoring algorithms for computing K-terminal reliability", IEEE Trans. Reliability, vol R-35, 1986, pp 269-278.
6. J.A. Abraham, "An improved algorithm for network reliability", IEEE Trans. Reliability, vol R-28, 1979, pp 58-61.
7. F. Beichelt, L. Spross, "An improved Abraham method for generating disjoint sums", IEEE Trans. Reliability, vol R-36, 1987, pp 70-74.
8. K.K. Aggarwal, J.S. Oupta, K.B. Misra, "A simple method for reliability evaluation of a communication system", IEEE Trans. Communications, vol COM-23, 1975, pp 563-566.
9. A. Satyanarayana, ' 'A unified formula for the analysis of some network reliability problems", IEEE Trans. Reliability, vol R-31, 1982, pp 23-32.
10. S. Hariri, C.S. Raghavendra, "SYREL: A symbolic reliability algorithm based on path and cutset methods", IEEE Trans. Computers, vol C-36, 1987 Oct, pp 1224-1232.
11. D. Rath, K.P. Soman, "A simple method for generating K-Trees of a network", Microelectronics & Reliability, vol 33, num 9, 1993, pp 1241-1244.
12. H.M. AboElFotoh, C.J. Colbourn, "Efficient algorithms for computing the reliability of permutation and interval graphs", Networks, vol 20, 1990, pp 883-898.
13. K. Sutner, A. Satyanarayana, C. Suffel, "The complexity of the residual node connectedness problem", SIAM J. Computing, vol 20, 1991 Feb, pp 149-155.
14. N. Deo, Graph Theory with Applications to Engineering and Computer Science, 1988, Series in Automatic Computation; Prentice Hall.