On Mapping Complete Binary Trees into Grids and Extended Grids

Parallel Architectures, Algorithms, and Networks, International Symposium on

Year: 1999, Pages: 242

Y.-B. Lin, University of Texas at Dallas
I.H. Sudborough, University of Texas at Dallas
Z. Miller, Miami University
D. Pritikin, Miami University
M. Perkel, Wright State University

We consider one-to-one, congestion one layouts of complete binary trees into 2-D grids and extended 2-D grids.

Like what you’re reading?

Already a member?

Get this article FREE with a new membership!