Edge-connectivity augmentation problems

Abstract

AbstractWe 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 |

Download PDF:
_{Sorry, we are unable to provide the full text but you may find it at the following location(s):}

https://s3.amazonaws.com/prod-... (external link)

https://s3-eu-west-1.amazonaws... (external link)