DISTRIBUTED ALGORITHMS FOR BUILDING HAMILTONIAN CYCLES IN k-ARY n-CUBES AND HYPERCUBES WITH FAULTY LINKS

Abstract

We derive a sequential algorithm Find-Ham-Cycle with the following property. On input: k and n (specifying the k-ary n-cube [Formula: see text]); F, a set of at most 2n − 2 faulty links; and v , a node of [Formula: see text], the algorithm outputs nodes v + and v − such that if Find-Ham-Cycle is executed once for every node v of [Formula: see text] then the node v + (resp. v −) denotes the successor (resp. predecessor) node of v on a fixed Hamiltonian cycle in [Formula: see text] in which no link is in F. Moreover, the algorithm Find-Ham-Cycle runs in time polynomial in n and log k. We also obtain a similar algorithm for an n-dimensional hypercube with at most n − 2 faulty links. We use our algorithms to obtain distributed algorithms to embed Hamiltonian cycles k-ary n-cubes and hypercubes with faulty links; our hypercube algorithm improves on a recently-derived algorithm due to Leu and Kuo, and our k-ary n-cube algorithm is the first distributed algorithm for embedding a Hamiltonian cycle in a k-ary n-cube with faulty links.