Least reliable networks and the reliability domination
暂无分享,去创建一个
[1] J. Scott Provan,et al. The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..
[2] R. Wilkov,et al. Analysis and Design of Reliable Computer Networks , 1972, IEEE Trans. Commun..
[3] G. Dirac. On rigid circuit graphs , 1961 .
[4] Mark K. Chang,et al. Network reliability and the factoring theorem , 1983, Networks.
[5] J. S. Provan,et al. Bounds on the reliability polynomial for shellable independence systems , 1982 .
[6] A. Satyanarayana,et al. Some Alternate Characterizations of Reliability Domination , 1990, Probability in the Engineering and Informational Sciences.
[7] Charles J. Colbourn,et al. The Combinatorics of Network Reliability , 1987 .
[8] Y. F. Lam,et al. Reliability Modeling and Analysis of Communication Networks with Dependent Failures , 1986, IEEE Trans. Commun..
[9] Richard M. Van Slyke,et al. Network reliability analysis: Part I , 1971, Networks.
[10] I. Frisch,et al. Analysis and Design of Survivable Networks , 1970 .
[11] Avinash Agrawal,et al. A Survey of Network Reliability and Domination Theory , 1984, Oper. Res..
[12] Charles J. Colbourn,et al. Bounding all-terminal reliability in computer networks , 1988, Networks.