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. © 2009 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Huang, P. C., Wei, H. W., Chen, Y. C., Kao, M. Y., Shih, W. K., & Hsu, T. S. (2009). Two-vertex connectivity augmentations for graphs with a partition constraint. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 1195–1204). https://doi.org/10.1007/978-3-642-10631-6_120
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
