Steiner trees in probabilistic networks

[1]  Charles J. Colbourn,et al.  Steiner trees, partial 2-trees, and minimum IFI networks , 1983, Networks.

[2]  Frank A. Tillman,et al.  System-Reliability Evaluation Techniques for Complex/Large SystemsߞA Review , 1981, IEEE Transactions on Reliability.

[3]  Arthur M. Farley,et al.  Computation of the center and diameter of outerplanar graphs , 1980, Discret. Appl. Math..

[4]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[5]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[6]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[7]  R. Wilkov,et al.  Analysis and Design of Reliable Computer Networks , 1972, IEEE Trans. Commun..

[8]  K. B. Misra,et al.  An Algorithm for the Reliability Evaluation of Redundant Networks , 1970 .

[9]  K. B. Misra,et al.  Reliability Analysis of Redundant Networks Using Flow Graphs , 1970 .

[10]  S. Yau,et al.  A Note on the Reliability of Communication Networks , 1962 .

[11]  Hisashi Mine,et al.  Reliability of physical system , 1959, IRE Trans. Inf. Theory.

[12]  Fred Moskowitz,et al.  The analysis of redundancy networks , 1958, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[13]  C. Y. Lee.  Analysis of switching networks , 1955 .

[14]  Charles J. Colbourn,et al.  COMPUTING RELIABILITY FOR A GENERALIZATION OF SERIES-PARALLEL NETWORKS. , 1982 .

[15]  Donald J. ROSE,et al.  On simple characterizations of k-trees , 1974, Discret. Math..

[16]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .