On Embedding Rectangular Grids in Square Grids

DOI10.1109/TC.1982.1676109MaRDI QIDQ3950483zbMATH OpenOpenAlexFDO

Authors Romas Aleliunas, Arnold L. Rosenberg

Publication date 1982

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1982.1676109

zbMATH Keywords

bounding aspect ratios of layoutsembedding graphs in gridsgeneric graphsgraph embeddingstheory of VLSI layouts

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Cited in

(11)

• Polymorphic arrays: A novel VLSI layout for systolic computers
• Embedding grids into hypercubes
• On the complexity of tree embedding problems
• A new combinatorial approach to optimal embeddings of rectangles
• Blocking for external graph searching
• On embedding rectangular meshes into rectangular meshes of smaller aspect ratio
• Perfect Storage Representations for Families of Data Structures
• Routing multiple paths in hypercubes
• Embedding cycles and meshes onto incomplete hypercubes
• Efficient embeddings of grids into grids
• On the k-ary hypercube

This page was built for publication: On Embedding Rectangular Grids in Square Grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3950483)