𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Minimum-Weight k-Edge Connected Steiner Networks on Metric Spaces

✍ Scribed by D. Frank Hsu; Xiao-Dong Hu; Guo-Hui Lin

Publisher
Springer Japan
Year
2000
Tongue
English
Weight
98 KB
Volume
16
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On minimally k-edge-connected graphs and
On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks
✍ Tibor JordΓ‘n πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 170 KB

A graph G = (V; E) is called minimally (k; T )-edge-connected with respect to some T βŠ† V if there exist k-edge-disjoint paths between every pair u; v ∈ T but this property fails by deleting any edge of G. We show that |V | can be bounded by a (linear) function of k and |T | if each vertex in V -T ha