An optimal embedding of cycles into incomplete hypercubes

Citation
Ch. Huang et al., An optimal embedding of cycles into incomplete hypercubes, INF PROCESS, 72(5-6), 1999, pp. 213-218
Citations number
12
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
INFORMATION PROCESSING LETTERS
ISSN journal
00200190 → ACNP
Volume
72
Issue
5-6
Year of publication
1999
Pages
213 - 218
Database
ISI
SICI code
0020-0190(199912)72:5-6<213:AOEOCI>2.0.ZU;2-O
Abstract
In order to use existing algorithms for rings and linear arrays on other ar chitectures, the embedding of cycles has been an important issue. In this p aper, we propose an optimal algorithm to embed cycles of arbitrary length i nto incomplete hypercubes. (C) 1999 Elsevier Science B.V. All rights reserv ed.