By Topic

Augmenting graphs to meet edge-connectivity requirements

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

1 Author(s)
Frank, Andras ; Res. Inst. for Discrete Math., Bonn Univ., West Germany

The problem of determining the minimum number γ of edges to be added to a graph G so that in the resulting graph the edge-connectivity between every pair {u,v} of nodes is at least a prescribed value r(u,v) is treated. A min-max formula for γ is derived, and a polynomial-time algorithm for computing γ is described. The directed counterpart of the problem is also solved for the case in which r(u,v)=k⩾1. The approach used makes it possible to solve a degree-constrained version of the problem. The minimum-cost augmentation problem can also be solved in polynomial time provided that the edge costs arise from node costs

Published in:

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

Date of Conference:

22-24 Oct 1990