✦ LIBER ✦

Edge-disjoint spanning trees: A connectedness theorem

✍ Scribed by M. Farber; B. Richter; H. Shank

Publisher: John Wiley and Sons
Year: 1985
Tongue: English
Weight: 268 KB
Volume: 9
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190090303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Property on Edge-disjoint Spanning Tre

A Property on Edge-disjoint Spanning Trees

✍ Hong-Jian Lai; Hongyuan Lai; Charles Payan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 214 KB

Let G be a simple graph with n vertices and let G c denote the complement of G . Let ( G ) denote the number of components of G and G ( E ) the spanning subgraph of G with edge set E . where the minimum is taken over all such partitions . In [ Europ . J . Combin . 7 (1986) , 263 -270] , Payan conj

Multicast in Wormhole-Switched Torus Net

Multicast in Wormhole-Switched Torus Networks Using Edge-Disjoint Spanning Trees

✍ Honge Wang; Douglas M. Blough 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 486 KB

A tree-based multicast algorithm for wormhole-switched networks which makes use of multiple edge-disjoint spanning trees is presented. The disjoint spanning-tree multicast, or DSTM, algorithm provides deadlock-free multicast routing that is fully compatible with unicast. The application of the DSTM