Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
SIAM Journal on Discrete Mathematics
Lee Distance and Topological Properties of k-ary n-cubes
IEEE Transactions on Computers
Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes
Journal of Parallel and Distributed Computing
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science
Panconnectivity and edge-pancyclicity of 3-ary N-cubes
The Journal of Supercomputing
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Sciences: an International Journal
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
Hamiltonian connectivity of the WK-recursive network with faulty nodes
Information Sciences: an International Journal
Embedding cycles and paths in a k-ary n-cube
ICPADS '07 Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01
Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links
IEEE Transactions on Parallel and Distributed Systems
Edge-fault-tolerant bipanconnectivity of hypercubes
Information Sciences: an International Journal
Long paths in hypercubes with conditional node-faults
Information Sciences: an International Journal
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
Information Sciences: an International Journal
Many-to-many disjoint paths in faulty hypercubes
Information Sciences: an International Journal
Embedding a fault-free hamiltonian cycle in a class of faulty generalized honeycomb tori
Computers and Electrical Engineering
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
The panpositionable panconnectedness of augmented cubes
Information Sciences: an International Journal
Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
Information Processing Letters
Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
Discrete Applied Mathematics
Pancyclicity of ternary n-cube networks under the conditional fault model
Information Processing Letters
Hamiltonian cycles passing through linear forests in k-ary n-cubes
Discrete Applied Mathematics
Geodesic pancyclicity of twisted cubes
Information Sciences: an International Journal
Panconnectivity of n-dimensional torus networks with faulty vertices and edges
Discrete Applied Mathematics
Fault-free Hamiltonian cycles passing through a linear forest in ternary n-cubes with faulty edges
Theoretical Computer Science
Conditional edge-fault pancyclicity of augmented cubes
Theoretical Computer Science
| Hi-index | 0.07 |
The k-ary n-cube, denoted by Q"n^k, is one of the most important interconnection networks for parallel computing. In this paper, we consider the problem of embedding cycles and paths into faulty 3-ary n-cubes. Let F be a set of faulty nodes and/or edges, and n=2. We show that when |F|=