Proceedings 32nd Annual Symposium of Foundations of Computer Science (1991)
San Juan, Puerto Rico
Oct. 1, 1991 to Oct. 4, 1991
T.-S. Hsu , Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
V. Ramachandran , Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
The problem of finding the smallest set of edges whose addition triconnects an undirected graph is considered. This is a fundamental graph-theoretic problem that has applications in designing reliable networks and fault-tolerant computing. A linear time sequential algorithm is given for the problem. This is a substantial improvement over the best previous algorithm for this problem, which runs in O(n(n+m)/sup 2/) time on a graph with n vertices and m edges.
vertices, triconnectivity augmentation, edges, undirected graph, reliable networks, fault-tolerant computing, linear time sequential algorithm
T. Hsu and V. Ramachandran, "A linear time algorithm for triconnectivity augmentation,"  Proceedings 32nd Annual Symposium of Foundations of Computer Science(FOCS), San Juan, Puerto Rico, 1991, pp. 548-559.