摘要
本文首先给出了一种无向通信网最优综合的新算法;然后在此基础上提出了一种边容量限定为整数的无向通信网最优综合算法。
A new algorithm for the optimal synthesis of undirected communication networks is proposed, then based on it, the algorithm for the optimal synthesis of undirected communication networks with integer edge capacities is given.
出处
《电子与信息学报》
EI
CSCD
1996年第S1期89-94,共6页
Journal of Electronics & Information Technology
关键词
通信网
图论
网络综合
边容量
Communication networks, Graph theory, Network synthesis, Edge capacities
