By Topic

A fast algorithm for optimally increasing the edge-connectivity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Naor, D. ; Div. of Comput. Sci., California Univ., Davis, CA, USA ; Gusfield, D. ; Martel, C.

An undirected, unweighted graph G=(V, E with n nodes, m edges, and connectivity λ) is considered. Given an input parameter δ, the edge augmentation problem is to find the smallest set of edges to add to G so that its edge-connectivity is increased by δ. A solution to this problem that runs in time O2nm+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 δ', 1⩽δ'⩽δ, in the same time bound. A modification of the solution solves the problem without knowing δ in advance. If δ=1, then the solution is particularly simple, running in O(nm) time, and it is a natural generalization of an algorithm of K. Eswaran and R.E. Tarjan (1976) for the case in which λ+δ=2. The converse problem (given an input number k, increase the connectivity of G as much as possible by adding at most k edges) is solved in the same time bound. The solution makes extensive use of the structure of particular sets of cuts

Published in:

Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on

Date of Conference:

22-24 Oct 1990