Minimum augmentation of a tree to a K-edge-connected graph
暂无分享,去创建一个
This paper solves the minimum augmentation problem for a given tree and positive integer k, that is, to make a tree k-edge-connected by adding the minimum number of edges. It is shown that the minimum number of edges is the least integer not less than a half of the deficiency of the tree which is defined as the sum of k-(degree) over all the vertices whose degrees are less than k. The proof is constructive and gives a polynomial-time algorithm for constructing such an augmentation.
[1] Yoji Kajitani,et al. The minimum augmentation of a directed tree to a k-edge-connected directed graph , 1986, Networks.
[2] Joseph JáJá,et al. Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..
[3] Robert E. Tarjan,et al. Augmentation Problems , 1976, SIAM J. Comput..