Abstract
Given an undirected multigraph G = (V, E) and requirement functions r λ : ( χ2 ) → Z + and r κ : ( χ2 ) Z + (where Z + is the set of nonnegative integers), we consider the problem of augmenting G by the smallest number of new edges so that the edge-connectivity and vertex connectivity between every pair χ, γ ε V become at least r λ (χ, γ) and r k ,(χ,γ), respectively, in the resulting graph G′. In this paper, we show that the problem can be solved in polynomial time if r k is given by r k,(χ, γ) = 2 for all χ, γ ε V.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G.-R. Cai and Y.-G. Sun, The minimum augmentation of any graph to k-edge-connected graph, Networks, Vo1.19, 1989, pp. 151–172.
K. P. Eswaran and R. E. Tarjan, Augmentation problems, SIAM J. Computing, Vol.5, 1976, pp. 653–665.
A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Mathematics, Vol.5, 1992, pp. 25–53.
H.N. Gabow, Applications of a poset representation to edge connectivity and graph rigidity, Proc. 32nd IEEE Symp. Found. Comp. Sci., 1991, pp.812–821.
H.N. Gabow, Efficient splitting off algorithms for graphs, Proceedings 26th ACM Symposium on Theory of Computing, 1994, pp. 696–705.
A.V. Goldberg and R.E. Tarjan, A new approach to the maximum flow problem, Proceedings 18th ACM Symposium on Theory of Computing, 1986, pp. 136–146.
T. Hsu and V. Ramachandran, A linear time algorithm for triconnectivity augmentation, Proc. 32nd IEEE Symp. Found. Comp. Sci., 1991, pp.548–559.
T. Hsu and V. Ramachandran, Finding a smallest augmentation to biconnect a graph, SIAM J. Computing, Vol.22, 1993, pp.889–912.
T. Hsu, Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation, Lecture Notes in Computer Science 920, Springer-Verlag, 6th ISAAC, 1995.
T. Ishii, H. Nagamochi, and T. Ibaraki, Augmenting edge-connectivity and vertex-connectivity simultaneously, Technical Report, Department of Applied Mathematics and Physics, Kyoto University, 1997.
T. Jordän, On the optimal vertex-connectivity augmentation, J. Combinatorial Theory, Series B, Vol.63, 1995, pp.8–20.
T. Jordán, Some remarks on the undirected connectivity, working paper, 1996.
W. Mader, A reduction method for edge-connectivity in graphs, Ann. Discrete Math., Vol.3, 1978, pp. 145–164.
H. Nagamochi and T. Ibaraki, Deterministic ≈O(m) time edge-splitting in undirected graphs, Proceedings 28th ACM Symposium on Theory of Computing, 1996, pp. 64–73 (in J. Combinatorial Optimization, 1, (1997), pp. 5–46).
T. Watanabe and A. Nakamura, Edge-connectivity augmentation problems, J. Comp. System Sci., Vol.35, 1987, pp.96–144.
T. Watanabe and A. Nakamura, A smallest augmentation to 3-connect a graph, Discrete Appl. Math., Vol.28, 1990, pp.183–186.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Toshimasa, I., Hiroshi, N., Toshihide, I. (1997). Augmenting edge and vertex connectivities simultaneously. In: Leong, H.W., Imai, H., Jain, S. (eds) Algorithms and Computation. ISAAC 1997. Lecture Notes in Computer Science, vol 1350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63890-3_12
Download citation
DOI: https://doi.org/10.1007/3-540-63890-3_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63890-2
Online ISBN: 978-3-540-69662-9
eBook Packages: Springer Book Archive