Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)

[[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.[[fileno]]2030218030056[[department]]資訊工程學