Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15] [ 16] [ 17] [ 18]

@

Journal of Information Science and Engineering, Vol. 31 No. 4, pp. 1347-1355 (July 2015)


A Linear Algorithm for Embedding of Cycles in Crossed Cubes with Edge-Pancyclic*


CHANG-HSIUNG TSAI AND CHIA-JUI LAI
Department of Computer Science and Information Engineering
National Dong Hwa University
Shoufeng, Hualien, 974 Taiwan
E-mail: chtsai@mail.ndhu.edu.tw; lai@ms01.dahan.edu.tw

In this paper, we consider the problem of embedding a cycle containing number of nodes from 4 to 2n through a prescribed edge in an n-dimensional crossed cube CQn. The main contribution of this paper is providing a systematic O(l) algorithm to find a cycle of length l containing (u, v) in CQn for any (u, v Î E(CQn) nd any integer l with 4 ≤ l ≤ 2n.

Keywords: interconnection network, cycles embedding, edge-pancyclic, embedding algorithm, crossed cubes

Full Text () Retrieve PDF document (201507_11.pdf)

Received January 25, 2014; revised April 2, 2014; accepted April 4, 2014.
Communicated by Ruay-Shiung Chang.
* This work was supported in part by the National Science Council, Taiwan under Contract NSC 98-2115-M- 259-002-MY2 and 100-2115-M-008.