Biconnectivity approximations and graph carvings
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
Fast algorithms for k-shredders and k-node connectivity augmentation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
An approximation algorithm for minimum-cost vertex-connectivity problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A new approximation algorithm for the planar augmentation problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Optimal augmentation to make a graph k-edge-connected and triconnected
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Simpler and faster biconnectivity augmentation
Journal of Algorithms
On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Security Problems for Statistical Databases with General Cell Suppressions
SSDBM '97 Proceedings of the Ninth International Conference on Scientific and Statistical Database Management
Hardness of Approximation for Vertex-Connectivity Network-Design Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Simpler and Faster Vertex-Connectivity Augmentation Algorithms
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
A simple algorithm for triconnectivity of a multigraph
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach
Journal of Combinatorial Theory Series B
The vulcan game of kal-toh: finding or making triconnected planar subgraphs
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
A novel data structure for biconnectivity, triconnectivity, and k-tree augmentation
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
| Hi-index | 0.00 |
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.