SHORTEST CONNECTION NETWORKS AND SOME GENERALIZATIONS
SHORTEST CONNECTION NETWORKS AND SOME GENERALIZATIONS
复制标题
DOI：
10.1002/j.1538-7305.1957.tb01515.x
复制
发表时间：
1957-01-01
影响因子：
--
通讯作者：
PRIM, RC
中科院分区：
文献类型：
--
作者：
PRIM, RC
考虑的基本问题是，互连一组给定的终端与最短的可能网络的直接链接。给出了用图解法和计算法求解这一问题的简单实用的方法。事实证明，这些程序还为更广泛的一类问题提供了解决方案，其中包含其他具有实际意义的示例。
The basic problem considered is that of interconnecting a given set of terminals with a shortest possible network of direct links. Simple and practical procedures are given for solving this problem both graphically and computationally. It develops that these procedures also provide solutions for a much broader class of problems, containing other examples of practical interest.