#### 3000OAA Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints

Tadachika OKI Satoshi TAOKA Toshiya MASHIMA Toshimasa WATANABE

IEICE Transactions on Information and Systems (ISSN:09168532)

vol.E95.D, no.3, pp.769-777, 2012-03-01 (Released:2012-03-01)

15

1

The k-edge-connectivity augmentation problem with bipartition constraints (kECABP, for short) is defined by “Given an undirected graph G=(V,E) and a bipartition π={VB,VW} of V with VB∩VW=∅, find an edge set Ef of minimum cardinality, consisting of edges that connect VB and VW, such that G'=(V,E∪Ef) is k-edge-connected.” The problem has applications for security of statistical data stored in a cross tabulated table, and so on. In this paper we propose a fast algorithm for finding an optimal solution to (σ+1)ECABP in O(|V||E|+|V2|log |V|) time when G is σ-edge-connected (σ > 0), and show that the problem can be solved in linear time if σ ∈ {1,2}.

[no-tag]

[algorithm]

### Twitter (1 users, 5 posts, 3 favorites)

で、ぼくはカクタスがもつこの性質を使って下記 URL のものをつくって、その続きを考えている。　＞一般のグラフの全ての最小カットをスッキリ保存できちゃう　https://t.co/VBlwFDxj9j
[Oki et al. 2012] A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints, https://t.co/VBlwFDxj9j
こちらとか。 https://t.co/VBlwFDxj9j

4 年くらい前ぼくが書いた論文はこちらからダウンロードできます。頂点集合の 2 分割内に辺を付加しない制約下における、辺連結度を 1 増加させるための高速解法です。　https://t.co/VBlwFDxj9j