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 and k = 3 can be solved in polynomial time for an arbitrary multigraph G
This research was partially supported by the Scientific Grant-in-Aid from Ministry of Education, Science, Sports and Culture of Japan, and the subsidy from the Inamori Foundation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
K. P. Eswaran and R. E. Tarjan, Augmentation problems, SIAM J. Compt., 5 1976, 653–665.
A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAMJ. Disc. Math., 5 1992, 25–53.
T. Hsu and V. Ramachandran, A linear time algorithm for triconnectivity augmen-tation, Proc. 32nd IEEE Symp. Found. Comp. Sci., 1991, 548–559.
T. Hsu and V. Ramachandran, Finding a smallest augmentation to biconnect a graph, SIAM J. Compt., 22 1993, 889–912.
T. Hsu, Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation, LNCS 920, Springer-Verlag, 6th ISAAC, 1995, pp. 274–283.
T. Hsu and M. Kao, Optimal bi-level augmentation for selectively enhancing graph connectivity with applications, LNCS 1090, Springer-Verlag, 2nd COCOON, 1996, 169–178.
T. Ishii, H. Nagamochi, and T. Ibaraki, Augmenting edge-connectivity and vertex-connectivity simultaneously, LNCS, Springer-Verlag, 8th ISAAC 1997, pp. 102–111.
T. Ishii, H. Nagamochi, and T. Ibaraki, Optimal augmentation to make a graph k-edge-connected and triconnected, Proc. of 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 280–289.
L. Lovász, Combinatorial Problems and Exercises, North-Holland, 1979.
T. Watanabe and A. Nakamura, Edge-connectivity augmentation problems, J. Comp. System Sci., 35 1987, 96–144.
T. Watanabe and A. Nakamura, A smallest augmentation to 3-connect a graph, Disc. Appl. Math., 28 1990, 183–186.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ishii, T., Nagamochi, H., Ibaraki, T. (1998). k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. In: Chwa, KY., Ibarra, O.H. (eds) Algorithms and Computation. ISAAC 1998. Lecture Notes in Computer Science, vol 1533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49381-6_18
Download citation
DOI: https://doi.org/10.1007/3-540-49381-6_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65385-1
Online ISBN: 978-3-540-49381-5
eBook Packages: Springer Book Archive