𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Steiner Networks with unicyclic connected components

✍ Scribed by Walid Ben-Ameur; Makhlouf Hadji

Book ID
108120782
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
197 KB
Volume
36
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On shortest two-connected Steiner networ
On shortest two-connected Steiner networks with Euclidean distance
✍ Hsu, D. Frank; Hu, Xiao-Dong πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 137 KB πŸ‘ 1 views

In this paper, we consider the problem of constructing the shortest two-connected Steiner network on the Euclidean plane. For a given set P of points on the Euclidean plane, let l 2 (P) denote the length of the shortest two-connected Steiner network on P divided by the length of the shortest two-con

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