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 √N-node hypercube. © 2002 Wiley Periodicals, Inc.
Author supplied keywords
Cite
CITATION STYLE
Fraigniaud, P., König, J. C., & Lazard, E. (2002). Oriented Hypercubes. Networks, 39(2), 98–106. https://doi.org/10.1002/net.10012
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.