K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph

Authors:
Toshimasa Ishii;Hiroshi Nagamochi;Toshihide Ibaraki
Affiliations:
-;-;-
Venue:
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Year:
1998

Citing 9
Cited 2

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
Optimal augmentation to make a graph k-edge-connected and triconnected

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
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

Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given an undirected multigraph G = (V,E) and two positive integers l and k, the edge-and-vertex connectivity augmentation problem asks to augment G by the smallest number of new edges so that the resulting multigraph becomes l-edge-connected and k-vertex-connected. In this paper, we show that the problem with a fixed l and k = 3 can be solved in polynomial time for an arbitrary multigraph G.