
doi: 10.1002/net.10012
AbstractIn this paper, we show how to give an orientation to the edges of an hypercube so that the inducedorientedhypercube offers approximately the same communication performance as that of the original nonoriented hypercube (routing, broadcasting, connectivity, etc.), that is, we show that it is possible to construct anN‐node oriented hypercube with the same communication and computational power as that of anN‐node hypercube, although with approximately the same pin‐complexity as that of a$\sqrt{N}$‐node hypercube. © 2002 Wiley Periodicals, Inc.
oriented hypercube, Network design and communication in computer systems, orientations, Graph theory (including graph drawing) in computer science, Directed graphs (digraphs), tournaments, broadcasting, [INFO] Computer Science [cs], Parallel algorithms in computer science
oriented hypercube, Network design and communication in computer systems, orientations, Graph theory (including graph drawing) in computer science, Directed graphs (digraphs), tournaments, broadcasting, [INFO] Computer Science [cs], Parallel algorithms in computer science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
