Optimal augmentation to make a graph k-edge-connected and triconnected

Authors:
Toshimasa Ishii;Hiroshi Nagamochi;Toshihide Ibaraki
Affiliations:
Department of Applied Mathematics and Physics, Kyoto University, Kyoto 606-01, Japan;Department of Applied Mathematics and Physics, Kyoto University, Kyoto 606-01, Japan;Department of Applied Mathematics and Physics, Kyoto University, Kyoto 606-01, Japan
Venue:
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Year:
1998

Edge-connectivity augmentation problems

Journal of Computer and System Sciences
A smallest augmentation to 3-connect a graph

Discrete Applied Mathematics
A linear time algorithm for triconnectivity augmentation (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Augmenting graphs to meet edge-connectivity requirements

SIAM Journal on Discrete Mathematics
Finding a smallest augmentation to biconnect a graph

SIAM Journal on Computing
A faster algorithm for finding the minimum cut in a directed graph

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Efficient splitting off algorithms for graphs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the optimal vertex-connectivity augmentation

Journal of Combinatorial Theory Series B
Augmenting Edge and Vertex Connectivities Simultaneously

ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Undirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity Augmentation

ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Optimal Bi-Level Augmentation for Selectivity Enhancing Graph Connectivity with Applications

COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
A Note on the Vertex-Connectivity Augmentation Problem

A Note on the Vertex-Connectivity Augmentation Problem

Hi-index	0.00