On Oriented Communication Nets
暂无分享,去创建一个
The solution to the problem of obtaining the maximum number of different values of terminal capacity in an oriented communication net is given. A sufficiency condition for the realizability of terminal capacity matrices is found which is more general than the necessary and sufficient conditions for the nonoriented communication net. A net satisfying this sufficiency condition is shown to have at most 2(v-1) different terminal capacities, where v is the number of vertices in the net
[1] R. Chien,et al. Analysis and Synthesis Techniques of Oriented Communication Nets , 1961 .
[2] W. Mayeda. Terminal and Branch Capacity Matrices of a Communication Net , 1960 .
[3] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[4] Peter Elias,et al. A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.
[5] O. Wing,et al. Optimal Synthesis of a Communication Net , 1961 .