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

Authors:
AndráS Frank;LáSzló A. VéGh
Affiliations:
MTA-ELTE Egerváry Research Group (EGRES) and Department of Operations Research, Eötvös University, Pázmány P. sétány 1/c, Budapest, H-1117, Hungary;MTA-ELTE Egerváry Research Group (EGRES) and Department of Operations Research, Eötvös University, Pázmány P. sétány 1/c, Budapest, H-1117, Hungary
Venue:
Discrete Optimization
Year:
2008

Citing 4
Cited 3

Augmenting graphs to meet edge-connectivity requirements

SIAM Journal on Discrete Mathematics
Minimal edge-coverings of pairs of sets

Journal of Combinatorial Theory Series B
Finding minimum generators of path systems

Journal of Combinatorial Theory Series B
Primal-dual approach for directed vertex connectivity augmentation and generalizations

ACM Transactions on Algorithms (TALG)

Augmenting undirected node-connectivity by one

Proceedings of the forty-second ACM symposium on Theory of computing
Jump number of two-directional orthogonal ray graphs

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
An overview of algorithms for network survivability

ISRN Communications and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a combinatorial polynomial-time algorithm to make a (k-1)-connected digraph k-connected by adding a minimum number of new edges.