A Recursive Method Based on Case Analysis for Computing Network Terminal Reliability
暂无分享,去创建一个
[1] G. K. McAuliffe,et al. Exact calculation of computer network reliability , 1974, Networks.
[2] E. Hansler. A Fast Recursive Algorithm to Calculate the Reliability of a Communication Network , 1972 .
[3] C. Y. Lee. Analysis of switching networks , 1955 .
[4] J. Hopcroft,et al. Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.
[5] Ugo Montanari,et al. Separable Graphs, Planar Graphs and Web Grammars , 1970, Inf. Control..
[6] K. K. Aggarwal,et al. A Simple Method for Reliability Evaluation of a Communication System , 1975, IEEE Trans. Commun..
[7] Luigi Fratta,et al. Synthesis of Available Networks , 1976, IEEE Transactions on Reliability.
[8] K.B. Misra,et al. A Fast Algorithm for Reliability Evaluation , 1975, IEEE Transactions on Reliability.
[9] Robert E. Tarjan,et al. Isomorphism of Planar Graphs , 1972, Complexity of Computer Computations.
[10] U. Montanari,et al. A Boolean algebra method for computing the terminal reliability in a communication network , 1973 .