Oriented hypercubes
Networks2002Vol. 39(2), pp. 98–106
Citations Over Time
Abstract
Abstract In this paper, we show how to give an orientation to the edges of an hypercube so that the induced oriented hypercube 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 an N ‐node oriented hypercube with the same communication and computational power as that of an N ‐node hypercube, although with approximately the same pin‐complexity as that of a $\sqrt{N}$ ‐node hypercube. © 2002 Wiley Periodicals, Inc.
Related Papers
- → Incomplete hypercubes: Algorithms and embeddings(1994)40 cited
- → Compact hypercubes: Properties and recognition(1991)5 cited
- → Oriented hypercubes(2002)3 cited
- → Fault-tolerant broadcasting in hypercubes via local safety information(2003)
- A Study on Reliable Broadcasting in Hypercubes Using Local-safety-information(2009)