On embedding rectangular grids in hypercubes

On embedding rectangular grids in hypercubes

The following graph-embedding question is addressed: given a two-dimensional grid and the smallest hypercube with at least as many nodes as grid points, how can one assign grid points to hypercube nodes (with at most one grid point per node) so as to keep grid neighbors near each other in the cube?...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE Trans. Comput.; (United States) 1988-10, Vol.37 (10), p.1285-1288
Hauptverfasser: Chan, M.Y., Chin, F.Y.L.
Format: Artikel
Sprache:eng
Schlagworte:
ALGORITHMS
Applied sciences
Binary trees
Computational modeling
Computer science
control theory
systems
Computer systems and distributed systems. User interface
COMPUTERS
Concurrent computing
Costs
ELECTRODES
Exact sciences and technology
GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
GRIDS
HYPERCUBE COMPUTERS
Hypercubes
Labeling
MATHEMATICAL LOGIC 990210 > Supercomputers-- (1987-1989)
Network topology
Reflective binary codes
Software
Time measurement
Tree graphs
TWO-DIMENSIONAL CALCULATIONS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The following graph-embedding question is addressed: given a two-dimensional grid and the smallest hypercube with at least as many nodes as grid points, how can one assign grid points to hypercube nodes (with at most one grid point per node) so as to keep grid neighbors near each other in the cube? An embedding scheme for an infinite class of two-dimensional grids is given that keeps grid neighbors within a distance of two apart.< >
ISSN:0018-9340
1557-9956
DOI:10.1109/12.5991