A New Combinatorial Approach to Optimal Embeddings of Rectangles

Algorithmica (New York)

Volumn 16, Issue 2, 1996, Pages 161-180

  Huang, Shou Hsuan S ^a   Liu, Hongfei ^a   Verma, Rakesh M ^a  

^a University of Houston   (United States)

Author keywords

Graph embedding problems; Mesh connected processor arrays; Minimum dilation; Minimum expansion; Parallel computation; Theory of VLSI layouts

Indexed keywords

EID: 0003948078     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01940645     Document Type: Article

References (17)

1. R. Aleliunas and A. L. Rosenberg, On Embedding Rectangular Grids in Square Grids, IEEE Trans. Comput., Vol. 31, No. 9, pp. 907-913, 1982.
2. S. Bhatt, F. Chung, T. Leighton, and A. L. Rosenberg, Optimal Simulations of Tree Machines, Proc. 27th Symp. on Foundations of Computer Science, pp. 274-282, 1986.
3. S. Bhatt, F. Chung, T. Leighton, and A. L. Rosenberg, Efficient Embeddings of Trees in Hypercubes, SIAM J. Comput., Vol. 21, No. 1, pp. 151-162, February 1992.
4. M. Y. Chan, Dilation-2 Embeddings of Grids into Hypercubes, Proc. Internat. Conf. on Parallel Processing, Vol. 3, pp. 295-298, 1988.
5. M. Y. Chan, Embedding of D-dimensional Grids into Optimal Hypercubes, Proc. Symp. on Parallel Algorithms and Architectures, pp. 52-57, 1989.
6. M. Y. Chan, Embedding Grids into Optimal Hypercubes, SIAM J. Comput., Vol. 20, No. 5, pp. 833-864, October 1991.
7. M. Y. Chan and F. Y. L. Chin, On Embedding Rectangular Grids in Hypercubes, IEEE Trans. Comput., Vol. 37, No. 10, pp. 1285-1288, 1988.
8. R. A. DeMillo, S. C. Eisenstat, and R. J. Lipton, Preserving Average Proximity in Arrays, Comm. ACM, Vol. 21, pp. 228-231, 1978.
9. J. A. Ellis, Embedding Rectangular Grids into Square Grids, IEEE Trans. Comput., Vol. 40, No. 1, pp. 46-52, 1991.
10. S. H. S. Huang, H. Liu, and R. M. Verma, On Embedding Rectangles into Optimal Squares, Proc. 22nd Internat. Conf. on Parallel Processing, Vol. III, pp. 73-76, 1993.
11. S. R. Kosaraju and M. J. Atallah, Optimal Simulations Between Mesh-Connected Arrays of Processors, Proc. ACM Symp. on Theory of Computing, pp. 264-272, 1986.
12. S. R. Kosaraju and M. J. Atallah, Optimal Simulations Between Mesh-Connected Arrays of Processors, J. Assoc. Comput. Mach., Vol. 35, pp. 635-650, 1988.
13. C. E. Leiserson, Area-Efficient Graph Layouts (for VLSI), Proc. 21st IEEE Symp. on Foundations of Computer Science, pp. 270-281, 1980.
14. R. J. Lipton, S. C. Eisenstat, and R. A. DeMillo, Space and Time Hierarchies for Classes of Control Structures and Data Structures, J. Assoc. Comput. Mach., Vol. 23, pp. 720-732, 1976.
15. F. Lombardi, D. Sciuto, and R. Stefanelli, An Algorithm for Functional Reconfiguration of Fixed-Size Arrays, IEEE Trans. Comput. Aided Design, Vol. 10, pp. 1114-1118, 1988.
16. A. L. Rosenberg and L. Snyder, Bounds on the Costs of Data Encoding, Math. Systems Theory, Vol. 12, pp. 9-39, 1978.
17. A. L. Rosenberg, Encoding Data Structures in Trees, J. Assoc. Comput. Mach., Vol. 26, pp. 668-689, 1979.