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 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications
Cite this
}
An optimal embedding of cycles into incomplete hypercubes. / Huang, Chien Hung; Hsiao, Ju-Yuan; Lee, R. C.T.
In: Information Processing Letters, Vol. 72, No. 5-6, 30.12.1999, p. 213-218.Research output: Contribution to journal › Article
TY - JOUR
T1 - An optimal embedding of cycles into incomplete hypercubes
AU - Huang, Chien Hung
AU - Hsiao, Ju-Yuan
AU - Lee, R. C.T.
PY - 1999/12/30
Y1 - 1999/12/30
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0033280494&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0033280494&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0033280494
VL - 72
SP - 213
EP - 218
JO - Information Processing Letters
JF - Information Processing Letters
SN - 0020-0190
IS - 5-6
ER -