Abstract
In this paper, we study the two-vertex connectivity augmentation problem in an undirected graph whose vertices are partitioned into k sets. Our objective is to add the smallest number of edges to the graph such that the resulting graph is 2-vertex connected under the constraint that each new edge is between two different sets in the partition. We propose an algorithm to solve the above augmentation problem that runs in linear time in the size of the input graph.
Supported in part by National Science Council (Taiwan) Grants NSC 97-2221-E-001-011-MY3.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Eswaran, K.P., Tarjan, R.E.: Augmentation problems. SIAM Journal on Computing 5, 653–665 (1976)
Gibbons., A.M.: Algorithmic Graph Theory. Cambridge University Press, Cambridge (1985)
Harary., F.: Graph Theory. Addison-Wesley, Reading (1969)
Hsu, T.-s.: Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract). In: Staples, J., Katoh, N., Eades, P., Moffat, A. (eds.) ISAAC 1995. LNCS, vol. 1004, pp. 274–283. Springer, Heidelberg (1995)
Hsu, T.-s.: On four-connecting a triconnected graph. Journal of Algorithms 35, 202–234 (2000)
Hsu, T.-s.: Simpler and faster vertex-connectivity augmentation algorithms (extended abstract). In: Paterson, M. (ed.) ESA 2000. LNCS, vol. 1879, pp. 278–289. Springer, Heidelberg (2000)
Hsu, T.-s.: Simpler and faster biconnectivity augmentation. Journal of Algorithms 45(1), 55–71 (2002)
Hsu, T.-s., Kao, M.Y.: Optimal augmentation for bipartite componentwise biconnectivity in linear time. SIAM Journal on Discrete Mathematics 19(2), 345–362 (2005)
Hsu, T.-s., Ramachandran, V.: On finding a smallest augmentation to biconnect a graph. SIAM Journal on Computing 22, 889–912 (1993)
Huang, P.C., Wei, H.W., Lu, W.C., Shih, W.K., Hsu, T.-s.: Smallest bipartite bridge-connectivity augmentation. Algorithmica 54(3), 353–378 (2009)
Rosenthal, A., Goldner, A.: Smallest augmentations to biconnect a graph. SIAM Journal on Computing 6, 55–66 (1977)
Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM Journal on Computing 1, 146–160 (1972)
Watanabe, T., Nakamura, A.: A minimum 3-connectivity augmentation of a graph. Journal of Computer and System Sciences 46, 91–128 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, PC., Wei, HW., Chen, YC., Kao, MY., Shih, WK., Hsu, Ts. (2009). Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract). In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_120
Download citation
DOI: https://doi.org/10.1007/978-3-642-10631-6_120
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10630-9
Online ISBN: 978-3-642-10631-6
eBook Packages: Computer ScienceComputer Science (R0)