✦ LIBER ✦

On Shortest k-Edge-Connected Steiner Networks in Metric Spaces

✍ Scribed by Xiufeng Du; Xiaodong Hu; Xiaohua Jia

Book ID: 110282490
Publisher: Springer US
Year: 2000
Tongue: English
Weight: 69 KB
Volume: 4
Category: Article
ISSN: 1382-6905
DOI: 10.1023/a:1009889023408

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Minimum-Weight k-Edge Connected Stein

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

✍ D. Frank Hsu; Xiao-Dong Hu; Guo-Hui Lin 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 98 KB

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