Embedding of Grids into Optimal Hypercubes
From MaRDI portal
Publication:3357515
DOI10.1137/0220052zbMath0731.68011OpenAlexW2083202979MaRDI QIDQ3357515
Publication date: 1991
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0220052
Planar graphs; geometric and topological aspects of graph theory (05C10) Mathematical problems of computer architecture (68M07) Applications of graph theory to circuits and networks (94C15)
Related Items (10)
Embedding complete multi-partite graphs into Cartesian product of paths and cycles ⋮ A new combinatorial approach to optimal embeddings of rectangles ⋮ Integer matrices with constraints on leading partial row and column sums ⋮ Compressing grids into small hypercubes ⋮ Scheduling task-trees with additive scales on parallel/distributed machines ⋮ Scheduling task-tree with additive scales on parallel/distributed machines ⋮ Embedding grids into hypercubes ⋮ Efficient embeddings of grids into grids ⋮ Embedding multidimensional grids into optimal hypercubes ⋮ Embedding meshes in hypercubes with edge faults
This page was built for publication: Embedding of Grids into Optimal Hypercubes
