𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Steiner Versions of (bi)Connectivity in Network Problems

✍ Scribed by A. Volgenant; C.W. Duin

Publisher
Springer Japan
Year
2004
Tongue
English
Weight
480 KB
Volume
20
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A problem on blocking probabilities in c
A problem on blocking probabilities in connecting networks
✍ F. R. K. Chung; F. K. Hwang πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 286 KB

## Abstract We begin with a three‐stage linear graph in which the first stage has a single node u and the third stage a single node v. The second stage has k independent nodes, each of which is connected by one link to u and to v. In general, we can form a (2n+1)‐stage linear graph recursively by l