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>