✦ LIBER ✦

Complete binary trees in folded and enhanced cubes

✍ Scribed by S.A. Choudum; R. Usha Nandini

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 177 KB
Volume: 43
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Link-disjoint embedding of complete bina

Link-disjoint embedding of complete binary trees in meshes

✍ Lee, Sang-Kyu; Choi, Hyeong-Ah 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB

We consider the problem of embedding complete binary trees into meshes with the objective of minimizing the link congestion. Gibbons and Paterson showed that a complete binary tree T p (with 2 p 0 1 nodes) can be embedded into a 2-dimensional mesh of 2 p nodes with link congestion two. Using the dim

Embedding Large Complete Binary Trees in

Embedding Large Complete Binary Trees in Hypercubes with Load Balancing

✍ Kemal Efe 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 211 KB

In the next section we present basic definitions and notations where the criterion of optimality is defined and related to the concept of ''normal'' algorithms. In Section 3 we present an optimal embedding method that balances the processor loads. In Section 4 we present a nonoptimal embedding metho

Optimal Embedding of Complete Binary Tre

Optimal Embedding of Complete Binary Trees into Lines and Grid

✍ Ralf Heckmann; Ralf Klasing; Burkhard Monien; Walter Unger 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Low-cost minimum-time line-broadcasting

Low-cost minimum-time line-broadcasting schemes in complete binary trees

✍ A. Averbuch; I. Gaber; Y. Roditty 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB

Multicolored trees in complete graphs

✍ S. Akbari; A. Alipour 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB

## Abstract A multicolored tree is a tree whose edges have different colors. Brualdi and Hollingsworth 5 proved in any proper edge coloring of the complete graph __K__~2__n__~(__n__ > 2) with 2__n__ − 1 colors, there are two edge‐disjoint multicolored spanning trees. In this paper we generalize thi

Patterns in random binary search trees

✍ Philippe Flajolet; Xavier Gourdon; Conrado Martínez 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB

In a randomly grown binary search tree BST of size n, any fixed pattern occurs with a frequency that is on average proportional to n. Deviations from the average case are highly unlikely and well quantified by a Gaussian law. Trees with forbidden patterns occur with an exponentially small probabilit