A new combinatorial approach to optimal embeddings of rectangles
From MaRDI portal
Publication:1920427
DOI10.1007/BF01940645zbMath0854.68067OpenAlexW3200712530MaRDI QIDQ1920427
Hong-fei Liu, Rakesh M. Verma, Shou-Hsuan Stephen Huang
Publication date: 20 October 1996
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01940645
Combinatorics in computer science (68R05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (2)
On embedding rectangular meshes into rectangular meshes of smaller aspect ratio ⋮ Efficient embeddings of grids into grids
Cites Work
- Embedding of Grids into Optimal Hypercubes
- On embedding rectangular grids in hypercubes
- Encoding Data Structures in Trees
- On Embedding Rectangular Grids in Square Grids
- Efficient Embeddings of Trees in Hypercubes
- Space and Time Hierarchies for Classes of Control Structures and Data Structures
- Preserving average proximity in arrays
- Bounds on the costs of data encodings
This page was built for publication: A new combinatorial approach to optimal embeddings of rectangles
