• DocumentCode
    1301617
  • Title

    Minimal mesh embeddings in binary hypercubes

  • Author

    Scott, David S. ; Brandenburg, Joe

  • Author_Institution
    Intel Sci. Comput., Beaverton, OR, USA
  • Volume
    37
  • Issue
    10
  • fYear
    1988
  • fDate
    10/1/1988 12:00:00 AM
  • Firstpage
    1284
  • Lastpage
    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)
  • 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;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.5990
  • Filename
    5990
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1301617