Augmenting Edge-Connectivity between Vertex Subsets


Given a directed or undirected graph G=(V,E), a collection ${\mathcal{R}}=\{(S_{i},T_{i}) \mid i=1,2,\ldots,|{\mathcal{R}}|, S_{i},T_{i} \subseteq V, S_{i} \cap T_{i} =\emptyset\}$ of two disjoint subsets of V, and a requirement function $r: {\mathcal{R}} \to\mathbb{R}_{+}$ , we consider the problem (called area-to-area edge-connectivity augmentation… (More)
DOI: 10.1007/s00453-012-9724-5


2 Figures and Tables

Cite this paper

@article{Ishii2009AugmentingEB, title={Augmenting Edge-Connectivity between Vertex Subsets}, author={Toshimasa Ishii and Kazuhisa Makino}, journal={Algorithmica}, year={2009}, volume={69}, pages={130-147} }