Construction of redundant networks with minimum distance
暂无分享,去创建一个
Abstract A method for constructing redundant networks and simultaneously minimizing total distance is presented. The method is well suited for digital computation. Its application to message switching systems is briefly discussed.
[1] Claude Berge,et al. The theory of graphs and its applications , 1962 .
[2] R. Prim. Shortest connection networks and some generalizations , 1957 .
[3] O. Ore. Theory of Graphs , 1962 .
[4] P. Baran,et al. On Distributed Communications Networks , 1964 .