Edge-connectivity augmentation problems

https://doi.org/10.1016/0022-0000(87)90038-9Get rights and content
Under an Elsevier user license
open archive

Abstract

We give a characterization on the minimum number of edges to be added so as to k-edge-connect a graph. We also show that such a minimum edge set can be determined in O(kL|V|4 (k|V| + |E|)) time for any graph G = (V E) and any fixed k≧2, where L = min {k, | V |}

Cited by (0)