Efficient embeddings of grids into grids

DOI10.1016/S0166-218X(00)00224-9zbMath0972.05016OpenAlexW2049129900MaRDI QIDQ5928873

U.-P. Schroeder, M. Röttger

Publication date: 9 November 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00224-9

zbMATH Keywords

embeddingdilationedge-congestiongrids

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (11)

Embeddings of circulant networks ⋮ Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees ⋮ Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength ⋮ Embedding Wheel - like Networks ⋮ Embedding of hypercubes into necklace, windmill and snake graphs ⋮ Bothway embedding of circulant network into grid ⋮ A linear time algorithm for embedding hypercube into cylinder and torus ⋮ Embedding of the folded hypercubes into tori ⋮ Unnamed Item ⋮ Exact wirelength of hypercubes on a grid ⋮ Separator-based graph embedding into multidimensional grids with small edge-congestion

Cites Work

• Unnamed Item
• Unnamed Item
• On embedding rectangular meshes into rectangular meshes of smaller aspect ratio
• Compressions and isoperimetric inequalities
• Optimal labelling of a product of two paths
• Edge isoperimetric theorems for integer point arrays
• A new combinatorial approach to optimal embeddings of rectangles
• The congestion of \(n\)-cube layout on a rectangular grid
• Embedding of Grids into Optimal Hypercubes
• On Embedding Rectangular Grids in Square Grids
• Embedding grids into grids: Techniques for large compression ratios
• Optimal numberings and isoperimetric problems on graphs

This page was built for publication: Efficient embeddings of grids into grids