A fast algorithm for optimally increasing the edge-connectivity

  • Authors:

  • D. Naor;D. Gusfield;C. Martel

  • Affiliations:

  • Div. of Comput. Sci., California Univ., Davis, CA, USA;Div. of Comput. Sci., California Univ., Davis, CA, USA;Div. of Comput. Sci., California Univ., Davis, CA, USA

  • Venue:
  • SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

An undirected, unweighted graph G=(V, E with n nodes, m edges, and connectivity lambda ) is considered. Given an input parameter delta , the edge augmentation problem is to find the smallest set of edges to add to G so that its edge-connectivity is increased by delta . A solution to this problem that runs in time O( delta /sup 2/nm+nF(n)), where F(n) is the time to perform one maximum flow on G, is given. The solution gives the optimal augmentation for every delta ', 1