A linear algorithm for embedding of cycles in crossed cubes
Chia-Jui Lai, Chang‐Hsiung Tsai · 2012
In this paper, we consider the problem of embedding a cycle containing number of nodes from 4 to 2nthrough a prescribed edge in an n-dimensional crossed cube CQn. Its theoretical proofs have been proposed in the literature. The main contribution of this paper is providing a systematic O(l) algorithm to find a cycle of length l containing (u, v) in CQnfor any (u, v) ∈ E(CQn) and any integer l with 4 ≤ l ≤ 2n.