This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Minimal Mesh Embeddings in Binary Hypercubes
October 1988 (vol. 37 no. 10)
pp. 1284-1285
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).

[1] D. W. Krumme, K. N. Venkataraman, and G. Cybenko, " Hypercube embedding is NP-complete," inHypercube Multiprocessors 1986, M. T. Health Ed. Philadelphia, PA: Siam, 1986, pp. 148-157.
[2] Y. Saad and M. H. Schultz, "Some topological properties of the hypercube multiprocessor," Res. Rep. 428, Dep. Comput. Sci., Yale Univ., 1984.

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, Oct. 1988, doi:10.1109/12.5990
Usage of this product signifies your acceptance of the Terms of Use.