The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1988 vol.37)
pp: 1284-1285
ABSTRACT
The authors state and prove a result about minimal graph embeddings of meshes into hypercubes. This corrects a flaw in a previously published proof by D.W. Krumme and K.N. Venkataraman (1986).
INDEX TERMS
minimal mesh embeddings; binary hypercubes; graph embeddings; graph theory; multiprocessing systems.
CITATION
D.S. Scott, J. Brandenburg, "Minimal Mesh Embeddings in Binary Hypercubes", IEEE Transactions on Computers, vol.37, no. 10, pp. 1284-1285, October 1988, doi:10.1109/12.5990
24 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool