Augmenting undirected node-connectivity by one

Authors:
László A. Végh
Affiliations:
Eotvos Lorand University, Budapest, Hungary
Venue:
Proceedings of the forty-second ACM symposium on Theory of computing
Year:
2010

Citing 11
Cited 4

Edge-connectivity augmentation problems

Journal of Computer and System Sciences
Augmenting graphs to meet edge-connectivity requirements

SIAM Journal on Discrete Mathematics
A minimum 3-connectivity augmentation of a graph

Journal of Computer and System Sciences
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
Independence free graphs and vertex connectivity augmentation

Journal of Combinatorial Theory Series B
On shredders and vertex connectivity augmentation

Journal of Discrete Algorithms
An algorithm to increase the node-connectivity of a digraph by one

Discrete Optimization

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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a min-max formula for the problem of augmenting the node-connectivity of a graph by one and give a polynomial time algorithm for finding an optimal solution. We also solve the minimum cost version for node-induced cost functions.