System design of the J-Machine
AUSCRYPT '90 Proceedings of the sixth MIT conference on Advanced research in VLSI
Theoretical Computer Science - Special issue on design and analysis of geometrical algorithms for robot motion planning and vision
Fast Sorting Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System
IEEE Transactions on Parallel and Distributed Systems
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
On Balancing Sorting on a Linear Array
IEEE Transactions on Parallel and Distributed Systems
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Mapping Cycles and Trees on Wrap-Around Butterfly Graphs
SIAM Journal on Computing
Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes
Journal of Parallel and Distributed Computing
Embedding meshes into crossed cubes
Information Sciences: an International Journal
Panconnectivity and edge-pancyclicity of 3-ary N-cubes
The Journal of Supercomputing
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
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
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
Many-to-many n-disjoint path covers in n-dimensional hypercubes
Information Processing Letters
Matching preclusion for k-ary n-cubes
Discrete Applied Mathematics
Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges
Information Sciences: an International Journal
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
Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes
Information and Computation
Hamiltonian path embeddings in conditional faulty k-ary n-cubes
Information Sciences: an International Journal
| Hi-index | 0.08 |
The class of k-ary n-cubes represents the most commonly used interconnection topology for distributed-memory parallel systems. In this paper, we study the problem of embedding paths of various lengths into faulty 3-ary n-cubes and prove that a faulty 3-ary n-cube with f=