THE AUGMENTATION OF ANY UNDIRECTED WEIGHTED GRAPH TO A K-EDGE-CONNECTED GRAPH

K. P. Eswaran, R. E. Tsrjan, SIAM J, Comput., 5(1976)4, 653-665.[2]S. Ueno, Y. Kujitani, H. Wada, The Minimum Augmentation of a Tree to a K-Edge-Connected Graph, Technical Research Reports, (1983-05), pp. 1-6, 1. E. G E., Japan.[3]Cai Guorui, Sun Yugeng, The Minimum Augmentation of any Connected Graph to a[4]K-Edge-Connected Graph, Proc. Int. Symp. on Circuit and Systems. pp. 984-987 (1986).[5]孙立山,孙雨耕,杨山,电子科学学刊,12(1990)6,593-599.[6]G. N. Frederickson, Joseph Jaja, SIAM J. Comput, 10(1981)2, 270-283.[7]B. Bollobas, Extremal Graph Theory, Academic Press, London (1978).[8]W. Mader, A Reduction Method for Edge-Connectivity in Graphs. in: B. Bollofis ed., Advances in Graph[9]Theory, Ann. Siscrete Math. 3(North-Holland, Amsterdam, 1978) pp. 145-164.