On the synthesis of optimally reliable networks having unreliable nodes but reliable edges
暂无分享,去创建一个
[1] R. V. Slyke,et al. On the validity of a reduction of reliable network design to a graph extremal problem , 1987 .
[2] Derek Smith,et al. Graphs with the smallest number of minimum cut sets , 1984, Networks.
[3] F. T. Boesch,et al. On the Invulnerability of the Regular Complete k-Partite Graphs , 1971 .
[4] Lynne L. Doty. Extremal connectivity and vulnerability in graphs , 1989, Networks.
[5] S. Louis Hakimi,et al. On the design of reliable networks , 1973, Networks.
[6] F. Harary. THE MAXIMUM CONNECTIVITY OF A GRAPH. , 1962, Proceedings of the National Academy of Sciences of the United States of America.