The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1991)
San Juan, Puerto Rico
Oct. 1, 1991 to Oct. 4, 1991
ISBN: 0-8186-2445-0
pp: 548-559
T.-S. Hsu , Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
V. Ramachandran , Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
ABSTRACT
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.
INDEX TERMS
vertices, triconnectivity augmentation, edges, undirected graph, reliable networks, fault-tolerant computing, linear time sequential algorithm
CITATION
T.-S. Hsu, V. Ramachandran, "A linear time algorithm for triconnectivity augmentation", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 548-559, 1991, doi:10.1109/SFCS.1991.185418
94 ms
(Ver 3.3 (11022016))