### Abstract

We consider the general problem of determining a smallest set of edges which must be added to a given graph (hypergraph, digraph) in order to make it k-edge-connected (k-vertex-connected). We give a short summary of those cases of the augmentation problems which have been solved by polynomial algorithms and min-max formulae. We then describe some recent progress we have made on the vertex-connectivity augmentation problem for undirected graphs.

Original language | English |
---|---|

Pages (from-to) | 1-4 |

Number of pages | 4 |

Journal | Electronic Notes in Discrete Mathematics |

Volume | 5 |

Publication status | Published - 2000 |

### Fingerprint

### Keywords

- Graph algorithms
- Graph connectivity

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Applied Mathematics

### Cite this

*Electronic Notes in Discrete Mathematics*,

*5*, 1-4.

**Connectivity augmentation of graphs.** / Jackson, Bill; Jordán, T.

Research output: Contribution to journal › Article

*Electronic Notes in Discrete Mathematics*, vol. 5, pp. 1-4.

}

TY - JOUR

T1 - Connectivity augmentation of graphs

AU - Jackson, Bill

AU - Jordán, T.

PY - 2000

Y1 - 2000

N2 - We consider the general problem of determining a smallest set of edges which must be added to a given graph (hypergraph, digraph) in order to make it k-edge-connected (k-vertex-connected). We give a short summary of those cases of the augmentation problems which have been solved by polynomial algorithms and min-max formulae. We then describe some recent progress we have made on the vertex-connectivity augmentation problem for undirected graphs.

AB - We consider the general problem of determining a smallest set of edges which must be added to a given graph (hypergraph, digraph) in order to make it k-edge-connected (k-vertex-connected). We give a short summary of those cases of the augmentation problems which have been solved by polynomial algorithms and min-max formulae. We then describe some recent progress we have made on the vertex-connectivity augmentation problem for undirected graphs.

KW - Graph algorithms

KW - Graph connectivity

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

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

M3 - Article

AN - SCOPUS:52849122748

VL - 5

SP - 1

EP - 4

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

SN - 1571-0653

ER -