A linear time augmenting algorithm for 3-edge-connectivity augmentation problems

The subject is the 3-edge-connectivity augmentation problem. Given an undirected multi-graph G/sub 0/=(V, E), find an edge set E' of minimum cardinality such that the graph (V, E union E') is 3-edge-connected, where each edge of E' connects vertices of V. The authors propose an O( mod V mod + mod E mod ) augmenting algorithm for the problem. It finds a solution to the 3-edge-connectivity augmentation problem if all k-components (k<or=3) of G/sub 0/ are available.<<ETX>>

[1]  H. Frank,et al.  Connectivity considerations in the design of survivable networks , 1970 .

[2]  Joseph JáJá,et al.  Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..

[3]  Akira Nakamura,et al.  Edge-Connectivity Augmentation Problems , 1987, J. Comput. Syst. Sci..

[4]  Yoji Kajitani,et al.  Minimum augmentation of a tree to a K-edge-connected graph , 1988, Networks.

[5]  A. Nakamura,et al.  3-edge-connectivity augmentation problems , 1989, IEEE International Symposium on Circuits and Systems,.

[6]  Akira Nakamura,et al.  A smallest augmentation to 3-connect a graph , 1990, Discret. Appl. Math..

[7]  Charles U. Martel,et al.  A fast algorithm for optimally increasing the edge-connectivity , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[8]  András Frank,et al.  Augmenting graphs to meet edge-connectivity requirements , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.