Connectivity augmentation of graphs

Bill Jackson, T. Jordán

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)1-4
Number of pages4
JournalElectronic Notes in Discrete Mathematics
Volume5
Publication statusPublished - 2000

Fingerprint

Augmentation
Connectivity
Polynomials
Graph in graph theory
Vertex Connectivity
Polynomial Algorithm
Min-max
Hypergraph
Undirected Graph
Digraph
Vertex of a graph

Keywords

  • Graph algorithms
  • Graph connectivity

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

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

In: Electronic Notes in Discrete Mathematics, Vol. 5, 2000, p. 1-4.

Research output: Contribution to journalArticle

@article{25a99adf77d04568b728f7ab32017760,
title = "Connectivity augmentation of graphs",
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.",
keywords = "Graph algorithms, Graph connectivity",
author = "Bill Jackson and T. Jord{\'a}n",
year = "2000",
language = "English",
volume = "5",
pages = "1--4",
journal = "Electronic Notes in Discrete Mathematics",
issn = "1571-0653",
publisher = "Elsevier",

}

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 -