Edge-connectivity augmentation with partition constraints

Jørgen Bang-Jensen, Harold N. Gabow, T. Jordán, Zoltán Szigeti

Research output: Contribution to journalArticle

36 Citations (Scopus)

Abstract

In the well-solved edge-connectivity augmentation problem, a minimum cardinality set F of edges to add to a given undirected graph to make it k-connected should be found. The generalization where every edge of F must go between two different sets of a given partition of the vertex set is solved. A special case of this partition-constrained problem increases the edge-connectivity of a bipartite graph to k while preserving bipartiteness. Based on this special case, an application of the results in statics is presented. The solution to the general partition-constrained problem gives a min-max formula for |F| which includes as a special case the original min-max formula for the problem without partition constraints.

Original languageEnglish
Pages (from-to)160-207
Number of pages48
JournalSIAM Journal on Discrete Mathematics
Volume12
Issue number2
Publication statusPublished - 1999

Fingerprint

Edge-connectivity
Augmentation
Partition
Min-max
Undirected Graph
Bipartite Graph
Cardinality
Vertex of a graph

ASJC Scopus subject areas

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Cite this

Bang-Jensen, J., Gabow, H. N., Jordán, T., & Szigeti, Z. (1999). Edge-connectivity augmentation with partition constraints. SIAM Journal on Discrete Mathematics, 12(2), 160-207.

Edge-connectivity augmentation with partition constraints. / Bang-Jensen, Jørgen; Gabow, Harold N.; Jordán, T.; Szigeti, Zoltán.

In: SIAM Journal on Discrete Mathematics, Vol. 12, No. 2, 1999, p. 160-207.

Research output: Contribution to journalArticle

Bang-Jensen, J, Gabow, HN, Jordán, T & Szigeti, Z 1999, 'Edge-connectivity augmentation with partition constraints', SIAM Journal on Discrete Mathematics, vol. 12, no. 2, pp. 160-207.
Bang-Jensen, Jørgen ; Gabow, Harold N. ; Jordán, T. ; Szigeti, Zoltán. / Edge-connectivity augmentation with partition constraints. In: SIAM Journal on Discrete Mathematics. 1999 ; Vol. 12, No. 2. pp. 160-207.
@article{29d3e39629bf4f03a88628ec9b41bc33,
title = "Edge-connectivity augmentation with partition constraints",
abstract = "In the well-solved edge-connectivity augmentation problem, a minimum cardinality set F of edges to add to a given undirected graph to make it k-connected should be found. The generalization where every edge of F must go between two different sets of a given partition of the vertex set is solved. A special case of this partition-constrained problem increases the edge-connectivity of a bipartite graph to k while preserving bipartiteness. Based on this special case, an application of the results in statics is presented. The solution to the general partition-constrained problem gives a min-max formula for |F| which includes as a special case the original min-max formula for the problem without partition constraints.",
author = "J{\o}rgen Bang-Jensen and Gabow, {Harold N.} and T. Jord{\'a}n and Zolt{\'a}n Szigeti",
year = "1999",
language = "English",
volume = "12",
pages = "160--207",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "2",

}

TY - JOUR

T1 - Edge-connectivity augmentation with partition constraints

AU - Bang-Jensen, Jørgen

AU - Gabow, Harold N.

AU - Jordán, T.

AU - Szigeti, Zoltán

PY - 1999

Y1 - 1999

N2 - In the well-solved edge-connectivity augmentation problem, a minimum cardinality set F of edges to add to a given undirected graph to make it k-connected should be found. The generalization where every edge of F must go between two different sets of a given partition of the vertex set is solved. A special case of this partition-constrained problem increases the edge-connectivity of a bipartite graph to k while preserving bipartiteness. Based on this special case, an application of the results in statics is presented. The solution to the general partition-constrained problem gives a min-max formula for |F| which includes as a special case the original min-max formula for the problem without partition constraints.

AB - In the well-solved edge-connectivity augmentation problem, a minimum cardinality set F of edges to add to a given undirected graph to make it k-connected should be found. The generalization where every edge of F must go between two different sets of a given partition of the vertex set is solved. A special case of this partition-constrained problem increases the edge-connectivity of a bipartite graph to k while preserving bipartiteness. Based on this special case, an application of the results in statics is presented. The solution to the general partition-constrained problem gives a min-max formula for |F| which includes as a special case the original min-max formula for the problem without partition constraints.

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

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

M3 - Article

AN - SCOPUS:0032624453

VL - 12

SP - 160

EP - 207

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 2

ER -