This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
September 1982 (vol. 31 no. 9)
pp. 907-913
R. Aleliunas, Department of Computer Science, University of Waterloo
The main results in this paper demonstrate that there exist pairs of integers (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
Index Terms:
theory of VLSI layouts, Bounding aspect ratios of layouts, embedding graphs in grids, generic graphs, graph embeddings
Citation:
R. Aleliunas, A.L. Rosenberg, "On Embedding Rectangular Grids in Square Grids," IEEE Transactions on Computers, vol. 31, no. 9, pp. 907-913, Sept. 1982, doi:10.1109/TC.1982.1676109
Usage of this product signifies your acceptance of the Terms of Use.