Abstract
An approximation algorithm is presented for augmenting an undirected weighted graph to aK-edge-connected graph. The algorithm is useful for designing a reliable network.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. P. Eswaran, R. E. Tarjan,SIAM J. Comput.,5 (1976) 4, 653–665.
S. ueno, Y. Kujitani, H. Wada, The Minimum Augmentation of a Tree to aK-Edge-connected Graph, Technical Research Reports, (1983–05), pp. 1–6, I. E. C. E., Japan.
Cai Guorai, Sun Yugeng,Networks,19 (1989) 151–172.
Sun Lishan, Sun Yugeng, Yang Shan,Journal of Electronics,12 (1990) 6, 593–599. (in Chinese).
G. N. Frederickson, Joseph Jaja,SIAM J. Comput. 10 (1981) 2, 270–283.
B. Bollobas, Extremal Graph Theory, Academic Press. London (1978).
W. Mader, A Reduction Method for Edge-Connectivity in Graph, ed., Advances in Graph Theory, Ann. Discrete Math. 3 (North-Holland, Amsterdam, 1978) pp. 145–164.
Author information
Authors and Affiliations
About this article
Cite this article
Lishan, S., Yugeng, S. & Shan, Y. The augmentation of undirected weighted graph to aK-edge-connected graph. J. of Electron.(China) 9, 218–224 (1992). https://doi.org/10.1007/BF02778732
Issue Date:
DOI: https://doi.org/10.1007/BF02778732