### Abstract

For an undirected multigraph G//0 equals (V, E//0 ) and a positive integer K, the problem of minimum augmentation of G//0 with respect to K-edge-connectivity (or K-MA) is to find a minimum set of edges E which, when added to G//0 , results in an K-edge-connected graph G equals G//0 plus E equals (V, E//0 U E). The problem of K-MA is considered in the general case where the existing graph G//0 can be any connected graph and an efficient algorith is presented. Two new concepts, extended augmentation and irreducible graph, are defined and studied. The estimation of the lower bound for the number of augmenting edges is tight and achievable by the algorithm.

Original language | English (US) |
---|---|

Pages (from-to) | 984-987 |

Number of pages | 4 |

Journal | Proceedings - IEEE International Symposium on Circuits and Systems |

State | Published - Jan 1 1986 |

### All Science Journal Classification (ASJC) codes

- Electrical and Electronic Engineering

### Cite this

}

**MINIMUM AUGMENTATION OF ANY CONNECTED GRAPH TO A K-EDGE-CONNECTED GRAPH.** / Cai, Guo Ray; Sun, Yu Geng.

Research output: Contribution to journal › Conference article

TY - JOUR

T1 - MINIMUM AUGMENTATION OF ANY CONNECTED GRAPH TO A K-EDGE-CONNECTED GRAPH.

AU - Cai, Guo Ray

AU - Sun, Yu Geng

PY - 1986/1/1

Y1 - 1986/1/1

N2 - For an undirected multigraph G//0 equals (V, E//0 ) and a positive integer K, the problem of minimum augmentation of G//0 with respect to K-edge-connectivity (or K-MA) is to find a minimum set of edges E which, when added to G//0 , results in an K-edge-connected graph G equals G//0 plus E equals (V, E//0 U E). The problem of K-MA is considered in the general case where the existing graph G//0 can be any connected graph and an efficient algorith is presented. Two new concepts, extended augmentation and irreducible graph, are defined and studied. The estimation of the lower bound for the number of augmenting edges is tight and achievable by the algorithm.

AB - For an undirected multigraph G//0 equals (V, E//0 ) and a positive integer K, the problem of minimum augmentation of G//0 with respect to K-edge-connectivity (or K-MA) is to find a minimum set of edges E which, when added to G//0 , results in an K-edge-connected graph G equals G//0 plus E equals (V, E//0 U E). The problem of K-MA is considered in the general case where the existing graph G//0 can be any connected graph and an efficient algorith is presented. Two new concepts, extended augmentation and irreducible graph, are defined and studied. The estimation of the lower bound for the number of augmenting edges is tight and achievable by the algorithm.

UR - http://www.scopus.com/inward/record.url?scp=0022566436&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022566436&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0022566436

SP - 984

EP - 987

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

SN - 0271-4310

ER -