Abstract
In order to use existing algorithms for rings and linear arrays on other architectures, the embedding of cycles has been an important issue. In this paper, we propose an optimal algorithm to embed cycles of arbitrary length into incomplete hypercubes.
| Original language | English |
|---|---|
| Pages (from-to) | 213-218 |
| Number of pages | 6 |
| Journal | Information Processing Letters |
| Volume | 72 |
| Issue number | 5-6 |
| Publication status | Published - 1999 Dec 30 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications
Fingerprint Dive into the research topics of 'An optimal embedding of cycles into incomplete hypercubes'. Together they form a unique fingerprint.
Cite this
Huang, C. H., Hsiao, J-Y., & Lee, R. C. T. (1999). An optimal embedding of cycles into incomplete hypercubes. Information Processing Letters, 72(5-6), 213-218.