✦ LIBER ✦

Embedding of cycles and wheels into arbitrary trees

✍ Scribed by Indra Rajasingh; Albert William; Jasintha Quadras; Paul Manuel

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A New Efficient Algorithm for Embedding

A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube

✍ Volker Heun; Ernst W. Mayr 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 250 KB

The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making it desirable to simulate binary trees on a hypercube. In this paper, we present a simple one-to-one embedding of arbitrar

Efficient Dynamic Embeddings of Binary T

Efficient Dynamic Embeddings of Binary Trees into Hypercubes

✍ Volker Heun; Ernst W. Mayr 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 255 KB

In this paper, a deterministic algorithm for dynamically embedding binary trees into hypercubes is presented. Because of a known lower bound, any such algorithm must use either randomization or migration, i.e., remapping of tree vertices, to obtain an embedding of trees into hypercubes with small di

Embedding arbitrary finite simple graphs

Embedding arbitrary finite simple graphs into small strongly regular graphs

✍ Jajcay, Robert; Mesner, Dale 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB 👁 1 views

It is well known that any finite simple graph Γ is an induced subgraph of some exponentially larger strongly regular graph Γ (e.g., [2,8]). No general polynomial-size construction has been known. For a given finite simple graph Γ on v vertices, we present a construction of a strongly regular graph Γ

Optimal Dynamic Embeddings of Complete B

Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes

✍ Volker Heun; Ernst W. Mayr 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 242 KB

It is folklore that the double-rooted complete binary tree is a spanning tree of the hypercube of the same size. Unfortunately, the usual construction of an embedding of a double-rooted complete binary tree into a hypercube does not provide any hint on how this embedding can be extended if each leaf

Congestion-free, dilation-2 embedding of

Congestion-free, dilation-2 embedding of complete binary trees into star graphs

✍ Tseng, Yu-Chee; Chen, Yuh-Shyan; Juang, Tong-Ying; Chang, Chiou-Jyu 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 291 KB 👁 2 views

Trees are a common structure to represent the intertask communication pattern of a parallel algorithm. In this paper, we consider the embedding of a complete binary tree in a star graph with the objective of minimizing congestion and dilation. We develop two embeddings: (i) a congestion-free, dilati