In communication networks, the distance between two nodes is one measure of transfer delay between them. Thus, it is required that the diameter of the network, which is defined as the maximum distance between every two nodes in it, is relatively small. This paper surveys the computational results on graph augmentation problems which model network design problems with diameter requirements, initiated in [F. R. K. Chung and M. R. Garey, ^^ ^^ Diameter bounds for altered graphs, " {em J. Graph Theory}, vol. 8, pp. 511–534, 1984].
展开▼
机译：在通信网络中，两个节点之间的距离是它们之间传输延迟的一种度量。因此，要求网络的直径相对较小，该直径定义为网络中每两个节点之间的最大距离。本文调查了图扩充问题的计算结果，该图模型以[F. R. K. Chung和M. R. Garey，^^^^变更图的直径范围，“ {em J.图论}，第8卷，第511–534页，1984年]。
展开▼
