Edge-connectivity augmentation problems
Journal of Computer and System Sciences
Augmenting graphs to meet edge-connectivity requirements
SIAM Journal on Discrete Mathematics
Scan-first search and sparse certificates: an improved parallel algorithm for k-vertex connectivity
SIAM Journal on Computing
A minimum 3-connectivity augmentation of a graph
Journal of Computer and System Sciences
On the complexity of recognizing tough graphs
Proceedings of the first Malta conference on Graphs and combinatorics
On the optimal vertex-connectivity augmentation
Journal of Combinatorial Theory Series B
Minimal edge-coverings of pairs of sets
Journal of Combinatorial Theory Series B
A note on the vertex-connectivity augmentation problem
Journal of Combinatorial Theory Series B
Fast algorithms for k-shredders and k-node connectivity augmentation
Journal of Algorithms
On four-connecting a triconnected graph
Journal of Algorithms
Non-separable detachments of graphs
Journal of Combinatorial Theory Series B
Extremal graphs in connectivity augmentation
Journal of Graph Theory
Primal-dual approach for directed vertex connectivity augmentation and generalizations
ACM Transactions on Algorithms (TALG)
Augmenting the connectivity of geometric graphs
Computational Geometry: Theory and Applications
Tight approximation algorithm for connectivity augmentation problems
Journal of Computer and System Sciences
An almost O(log k)-approximation for k-connected subgraphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On triconnected and cubic plane graphs on given point sets
Computational Geometry: Theory and Applications
Approximating Node-Connectivity Augmentation Problems
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximating connectivity augmentation problems
ACM Transactions on Algorithms (TALG)
Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Note: Local edge-connectivity augmentation in hypergraphs is NP-complete
Discrete Applied Mathematics
Augmenting undirected node-connectivity by one
Proceedings of the forty-second ACM symposium on Theory of computing
Bounded length, 2-edge augmentation of geometric planar graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Testing Eulerianity and connectivity in directed sparse graphs
Theoretical Computer Science
Connectivity augmentation in planar straight line graphs
European Journal of Combinatorics
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach
Journal of Combinatorial Theory Series B
Lower bounds on information dissemination in dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
A novel data structure for biconnectivity, triconnectivity, and k-tree augmentation
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
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
An overview of algorithms for network survivability
ISRN Communications and Networking
Fixed-Parameter algorithms for minimum cost edge-connectivity augmentation
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.01 |
Given an undirected graph G and a positive integer k, the k-vertex-connectivity augmentation problem is to find a smallest set F of new edges for which G + F is k-vertex-connected. Polynomial algorithms for this problem have been found only for k ≤ 4 and a major open question in graph connectivity is whether this problem is solvable in polynomial time in general.In this paper, we develop an algorithm which delivers an optimal solution in polynomial time for every fixed k. In the case when the size of an optimal solution is large compared to k, our algorithm is polynomial for all k. We also derive a min-max formula for the size of a smallest augmenting set in this case. A key step in our proofs is a complete solution of the augmentation problem for a new family of graphs which we call k-independence free graphs. We also prove new splitting off theorems for vertex connectivity.