Title :
Minimal mesh embeddings in binary hypercubes
Author :
Scott, David S. ; Brandenburg, Joe
Author_Institution :
Intel Sci. Comput., Beaverton, OR, USA
fDate :
10/1/1988 12:00:00 AM
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)
Keywords :
graph theory; multiprocessing systems; binary hypercubes; graph embeddings; minimal mesh embeddings; Automata; Automatic testing; Circuit testing; Computer architecture; Equations; Error correction; Fault tolerance; Flip-flops; Hypercubes; Reliability;
Journal_Title :
Computers, IEEE Transactions on
