System design of the J-Machine
AUSCRYPT '90 Proceedings of the sixth MIT conference on Advanced research in VLSI
The achievement of knowledge bases by cycle search
Information and Computation
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
SIAM Journal on Discrete Mathematics
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes
Journal of Parallel and Distributed Computing
Cycles embedding in hypercubes with node failures
Information Processing Letters
Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m,4)
Theoretical Computer Science
Weak-vertex-pancyclicity of (n, k)-star graphs
Theoretical Computer Science
Edge-bipancyclicity of a hypercube with faulty vertices and edges
Discrete Applied Mathematics
Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links
IEEE Transactions on Parallel and Distributed Systems
The bipancycle-connectivity of the hypercube
Information Sciences: an International Journal
Bipanconnectivity and Bipancyclicity in k-ary n-cubes
IEEE Transactions on Parallel and Distributed Systems
Path embeddings in faulty 3-ary n-cubes
Information Sciences: an International Journal
Blue Gene/L torus interconnection network
IBM Journal of Research and Development
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
The Edge-Fault-Tolerant Bipancyclicity of the Even k-ary n-cube
The Computer Journal
Bipancyclicity in k-Ary n-Cubes with Faulty Edges under a Conditional Fault Assumption
IEEE Transactions on Parallel and Distributed Systems
Hamiltonian path embeddings in conditional faulty k-ary n-cubes
Information Sciences: an International Journal
| Hi-index | 0.00 |
The k-ary n-cube has been one of the most popular interconnection networks for distributed-memory parallel systems. In this paper, we study the problem of embedding cycles of various lengths into faulty k-ary n-cubes. It is proved that a faulty k-ary n-cube with f"v faulty vertices and f"e faulty edges admits a fault-free cycle of every even length from 4 to k^n-2f"v if k=4 is even and f"v+f"e==4 is even and f"v+f"e=