Three-dimensional embedding of binary trees

Proceedings - International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 2000

Volumn , Issue , 2000, Pages 140-147

  Bein, Wolfgang W ^a   Larmore, Lawrence L ^a   Shields, Charles ^b   Sudborough, I Hal ^b  

^a University of Nevada Las Vegas   (United States)

^b The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; COMPUTER AIDED DESIGN;

3D GRID; COMPLETE BINARY TREE; COMPUTER ENVIRONMENTS; EMBEDDINGS; EXPANSION RATIO; GRAPH DRAWING; NUMBER OF LAYERS; PARALLEL COMPUTER; THREE-DIMENSIONAL GRIDS; TREE NODES;

DRAWING (GRAPHICS);

EID: 80052019925     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPAN.2000.900278     Document Type: Conference Paper

References (14)

1. S. N. Bhatt and S. S. Cosmadakis. The Complexity of minimizing wire lengths in VLSI layouts. Infomation Processing Letters, 25:263-267, 1987.
2. S. A. Browning. The Bee machine, a highly concurrent computing enwiroment. PhD thesis, CIT, 1980.
3. B. Ducourthial and A. Merigot. Graph embedding in the associative mesh model. Manuscript, 1996.
4. A. Gregori. Unit-length embedding of binary trees in a square grid. Information Processing Letters, 31:167-173, 1989.
5. Ajay K. Gupta and Susanne E. Hambrusch. Embedding complete binary trees into butterfly networks. !l!ransactions on Computers, 40(7):853-863, 1991.
6. R. Heckmann, R. Klasing, B. Monien, and W. Unger. Optimal embedding of complete binary trees into lines and grids. In Proceedings of the 17th Graph Theoretic Concepts in Computer Science, volume 570 of Lecture Notes in Computer Science. Springer, 1991.
7. M.-C. Heydemann, J. Opatrny, and D. Sotteau. Embedding complete binary trees into extendedgrids with edge congestion 1. In Parallel Algorithms and Applications, volume 805 of Lecture Notes in Computer Science. Springer, 1994.
8. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Dees, and Hypercubes. Morgan Kaufmann, San Mateo, CA, 1992.
9. Z. Miller, M. Perkel, D. Pritikin, and I. H. Sudborough. Expansions of layouts of complete binary trees into grids I - upper bounds. Submitted, 2000.
10. Z. Miller, M. Perkel, D. Pritikin, and I. H. Sudborough. Expansions of layouts of complete binary trees into grids I1 - lower bounds. Submitted, 2000.
11. B. Monien and I. H. Sudborough. Embedding one interconnection network in another. Computing Supplement, 7:257-282, 1990.
12. J. Opatrny and D. Sotteau. Embeddings of complete binary trees into grids and extended gr ids with total vertex-congestion 1. Discrete Applied Mathematics, 98937-254, 2000.
13. M. S. Patterson, W. RUZZO, and L. Snyder. Bounds on minimax edge length for complete binary trees. In Proc. 23rd Symp. Theory of Computing,1991.
14. P. Zienicke. Embeddings of treelike graphs into 2-dimensional meshes. In Proceedings of the Conference on Graph Theoretic Concepts in Computer Science, volume 484 of Lecture Notes in Computer Science. Springer, 1990.