Distributed fault-tolerant embeddings of rings in hypercubes
Journal of Parallel and Distributed Computing
Performance of the CRAY T3E multiprocessor
SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
Hi-index | 0.00 |
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.