Proceedings Article10.1109/SPDP.1992.242739
On embedding ternary trees into Boolean hypercubes
Ajay Gupta,H. Wang +1 more
- 01 Dec 1992
- pp 230-235
3
TL;DR: The authors present some preliminary results that give efficient embeddings for the situations when k=3, 2/sup p/, 3/Sup p/, 2/ Sup p/*3/sup q/ and p, q>0.
read more
Abstract: It is pointed out that the problem of efficiently embedding a k-ary tree into hypercube with k>or=3 has largely remained unsolved, even though optimal embeddings (i.e. embeddings achieving minimum delta , lambda , and in ) of complete and incomplete binary trees into hypercubes have been known for some time. Thus, in their quest for designing efficient embeddings of k-ary trees into hypercube for arbitrary k, the authors present some preliminary results that give efficient embeddings for the situations when k=3, 2/sup p/, 3/sup p/, 2/sup p/*3/sup q/ and p, q>0. The embedding of complete ternary trees and the embedding of complete k-ary trees are considered. >
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Embedding Full Ternary Trees into Recursive Circulants
Cheol Ki Kim,Jung Choi,Hyeong-Seok Lim +2 more
- 29 Oct 2002
TL;DR: It is shown that k level full ternary trees whose number of vertices are not more than N can be embedded into recursive circulants G(N,2) and G (N,3) with dilation 2.
5
On Embedding of a Hypercube in a Completely Overlapping Network
TL;DR: It is shown that a d-dimensional hypercube network can be embedded into a new theoretical network called Completely Overlapping Network or CON, and that the embedded d- dimensional hypercube can be scaled using latency hiding.
1
References
•Book
Graph theory with applications
J. A. Bondy
- 01 Jan 1976
TL;DR: In this paper, the authors present Graph Theory with Applications: Graph theory with applications, a collection of applications of graph theory in the field of Operational Research and Management. Journal of the Operational research Society: Vol. 28, Volume 28, issue 1, pp. 237-238.
8.8K
Topological properties of hypercubes
Y. Saad,M.H. Schultz +1 more
TL;DR: The authors examine the hypercube from the graph-theory point of view and consider those features that make its connectivity so appealing and propose a theoretical characterization of the n-cube as a graph.
1.4K
Optimal simulations of tree machines
Sandeep N. Bhatt,Fan Chung,Tom Leighton,Arnold L. Rosenberg +3 more
- 27 Oct 1986
TL;DR: This paper investigates simulations of tree machines; the fact that divide-and-conquer algorithms are programmed naturally on trees motivates the investigation, and constructs a universal bounded-degree network on N nodes for which every N node binary tree is a spanning tree.
173
How to Embed Trees in Hypercubes.
Sandeep N. Bhatt,Ilse C. F. Ipsen +1 more
- 01 Dec 1985
TL;DR: This paper provides a novel and optimal embedding of a complete binary tree in which all but one tree edges are mapped onto adjacent processors on the hypercube, and the remaining edge is routed through an unused processor.
114