Abstract
The k-edge-connectivity augmentation problem for a specified set of vertices (kECA-SV for short) is defined by “Given a graph G = (V, E) and a subset Γ ⊆ V, find a minimum set E’ of edges, each connecting distinct vertices of V, such that G’ = (V, E ∪ E’) has at least k edge-disjoint paths between any pair of vertices in Γ.” We propose an O(λ 2 |V|(|V| + |Γ| log λ) + |E|) algorithm for (λ + 1)ECA-SV with Γ ⊆ V, where, λ is the edge-connectivity of Γ (the cardinality of a minimum cut separating two vertices of Γ). Also mentioned is an O(|V| log |V| + |E|) algorithm for a special ease where λ is equal to the edge-connectivity of G.
Cite
CITATION STYLE
Taoka, S., & Watanabe, T. (1994). Minimum augmentation to k-edge-connect specified vertices of a graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 217–225). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_184
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
