✦ LIBER ✦

Spanning trees on hypercubic lattices and nonorientable surfaces

✍ Scribed by W.-J Tzeng; F.Y Wu

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 337 KB
Volume: 13
Category: Article
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(00)00071-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hierarchical spanning trees and distribu

Hierarchical spanning trees and distributing on incomplete hypercubes

✍ Jenn-Yang Tien; Wei-Pang Yang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 873 KB

Tien, J.-Y. and W.-P. Yang, Hierarchical spanning trees and distributing on incomplete hypercubes, Parallel Computing 17 (1991) 1343-1360\_ Incomplete hypercubes are gaining increasing attention as one of the possible solutions for the limitation on the number of nodes in the hypercubes. Distributi

On constructing multiple spanning trees

On constructing multiple spanning trees in a hypercube

✍ Feng-Hsu Wang; Ferng-Ching Lin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 627 KB

Parallel construction of optimal indepen

Parallel construction of optimal independent spanning trees on hypercubes

✍ Jinn-Shyong Yang; Shyue-Ming Tang; Jou-Ming Chang; Yue-Li Wang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 212 KB

The use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides a number of advantages, including the increase of fault-tolerance and bandwidth. Thus, the designs of multiple ISTs on several classes of networks have been widely investigated. Tang et al. [S.-M. Tang,

Uniform and minimal essential spanning f

Uniform and minimal essential spanning forests on trees

✍ Olle Häggström 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB

Uniform and minimal random spanning trees for finite graphs are well-known objects. Analogues of these for the nearest-neighbor graph on Z d have been studied by Pemantle and Alexander. Here we propose analogous definitions of uniform resp. minimal essential spanning forests for an infinite tree ⌫,

A note on bisecting minimum spanning tre

A note on bisecting minimum spanning trees

✍ W. M. Boyce; M. R. Garey; D. S. Johnson 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 281 KB

Independent spanning trees on folded hyp

Independent spanning trees on folded hyper-stars

✍ Jinn-Shyong Yang; Jou-Ming Chang 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 302 KB

## Abstract Fault‐tolerant broadcasting and secure message distribution are important issues for numerous applications in networks. It is a common idea to design multiple independent spanning trees (ISTs) as a broadcasting scheme or a distribution protocol for receiving high levels of fault‐toleran