Issue No. 09 - September (1982 vol. 31)
R. Aleliunas , Department of Computer Science, University of Waterloo
The main results in this paper demonstrate that there exist pairs of integers <E, D> (for "area Expansion" and "edge Dilation," respectively) such that any n-vertex rectangular grid can be embedded into a square grid having at most En vertices, in such a way that images in the square grid of vertices that are adjacent in the rectangular grid are at most distance D apart. Several techniques for "sq
theory of VLSI layouts, Bounding aspect ratios of layouts, embedding graphs in grids, generic graphs, graph embeddings
R. Aleliunas and A. Rosenberg, "On Embedding Rectangular Grids in Square Grids," in IEEE Transactions on Computers, vol. 31, no. , pp. 907-913, 1982.