Simpler and Faster Vertex-Connectivity Augmentation Algorithms

Authors:
Tsan-sheng Hsu
Affiliations:
-
Venue:
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Year:
2000

Citing 10
Cited 1

Approximate parallel scheduling. II.: applications to logarithmic-time optimal parallel graph algorithms

Information and Computation
A linear time algorithm for triconnectivity augmentation (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Finding triconnected components by local replacement

SIAM Journal on Computing
Finding a smallest augmentation to biconnect a graph

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

Journal of Computer and System Sciences
Graph augmentation and related problems: theory and practice

Graph augmentation and related problems: theory and practice
On the optimal vertex-connectivity augmentation

Journal of Combinatorial Theory Series B
Finding connected components in O(log n loglog n) time on the EREW PRAM

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On four-connecting a triconnected graph

Journal of Algorithms
Undirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity Augmentation

ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation

Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new technique to solve the problem of adding a minimum number of edges to an undirected graph in order to obtain a k-vertex-connected resulting graph, for k = 2 and 3.