✦ LIBER ✦

Packing trees in communication networks

✍ Scribed by Mohamed Saad; Tamás Terlaky; Anthony Vannelli; Hu Zhang

Publisher: Springer US
Year: 2008
Tongue: English
Weight: 456 KB
Volume: 16
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-008-9150-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing in trees

✍ Michael A. Henning 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 532 KB

Let G be a graph and let v be a vertex of G. The open neighbourhood N(v) of v is the set of all vertices adjacent with v in G, while the closed neighbourhood of v is N(v) U {v}. A packing of a graph G is a set of vertices whose closed neighbourhoods are pairwise disjoint. Equivalently, a packing of

Tree-forming reversible routes in commun

Tree-forming reversible routes in communication networks

✍ Alistair A.R. Cockburn 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 1015 KB

Strength and reinforcement of a network

Strength and reinforcement of a network and tree packing

✍ V. A. Trubin 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 895 KB

Gene sharing and genome evolution: netwo

Gene sharing and genome evolution: networks in trees and trees in networks

✍ Robert G. Beiko 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 243 KB

Experiments in communication networks

✍ G. M. Cady; B. P. Lientz; N. E. Willmorth 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 887 KB

Steiner trees in probabilistic networks

✍ Joseph A. Wald; Charles J. Colbourn 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 332 KB