An optimal embedding of cycles into incomplete hypercubes

Chien Hung Huang, Ju-Yuan Hsiao, R. C.T. Lee

Research output: Contribution to journalArticle

5 Citations (Scopus)

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 languageEnglish
Pages (from-to)213-218
Number of pages6
JournalInformation Processing Letters
Volume72
Issue number5-6
Publication statusPublished - 1999 Dec 30

Fingerprint

Hypercube
Cycle
Linear Array
Optimal Algorithm
Ring
Arbitrary
Architecture

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this

Huang, Chien Hung ; Hsiao, Ju-Yuan ; Lee, R. C.T. / An optimal embedding of cycles into incomplete hypercubes. In: Information Processing Letters. 1999 ; Vol. 72, No. 5-6. pp. 213-218.
@article{e20032e18e824f8db89512fe1f177b13,
title = "An optimal embedding of cycles into incomplete hypercubes",
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.",
author = "Huang, {Chien Hung} and Ju-Yuan Hsiao and Lee, {R. C.T.}",
year = "1999",
month = "12",
day = "30",
language = "English",
volume = "72",
pages = "213--218",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "5-6",

}

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 journalArticle

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 -