Abstract
Consideration was given to the following problem. In the binary hypercube, given is a Hamiltonian cycle with faulty edges, or vertices, or both. Needed is to construct a length-maximum cycle without faulty components of the hypercube. The cycles are defined by the ring sequences of the weights of the hypercube edges belonging to them. The discussion was based on the example of a binary 4-dimensional hypercube.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Anderson, E., Brooks, J., Grass, G., et al., Performance of the Cray T3E multiprocessor, Proc. IEEE ACM Supercomput. Conf., San Jose, 1997, pp. 15–21.
Zykov, A.A., Osnovy teorii grafov (Fundamentals of the Graph Theory), Moscow: Nauka, 1987.
Chan, M.Y. and Lee, S.J., Distributed Fault-tolerant Embeddings of Rings in Hypercubes, J. Parallel Distributed Comput., 1991, vol. 11, no.1, pp. 63–71.
Latifi, S., Zheng, S.Q., and Bagherzadeh, M., Optimal Ring Embeddings in Hypercubes with Faulty Links, Proc. IEEE Symp. Fault-Tolerant Comput., 1992, pp. 178–184.
Parkhomenko, P.P., Classification of the Hamiltonian Cycles in Binary Hypercubes, Avtom. Telemekh., 2001, no. 6, pp. 135–150.
Parkhomenko, P.P., Construction of Hamiltonian Cycles in the Binary Hypercubes with Faulty Edges, in Tr. IPU RAN (Proc. IPU RAN), 2003, vol. XXX, pp. 21–33.
Author information
Authors and Affiliations
Additional information
Translated from Avtomatika i Telemekhanika, No. 4, 2005, pp. 141–155.
Original Russian Text Copyright © 2005 by Parkhomenko.
This paper was recommended for publication by P.Yu. Chebotarev, a member of the Editorial Board
Rights and permissions
About this article
Cite this article
Parkhomenko, P.P. Construction of maximum cycles in faulty binary hypercubes. Autom Remote Control 66, 633–645 (2005). https://doi.org/10.1007/s10513-005-0106-1
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10513-005-0106-1