Edge Congestion and Topological Properties of Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Hamilton-connectivity and cycle-embedding of the Möbius cubes
Information Processing Letters
Embedding Binary Trees into Crossed Cubes
IEEE Transactions on Computers
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Paths in Möbius cubes and crossed cubes
Information Processing Letters
Highly fault-tolerant cycle embeddings of hypercubes
Journal of Systems Architecture: the EUROMICRO Journal
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science
Embedding meshes into crossed cubes
Information Sciences: an International Journal
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
IEEE Transactions on Parallel and Distributed Systems
Cycles passing through prescribed edges in a hypercube with some faulty edges
Information Processing Letters
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
Edge-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences: an International Journal
Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m,4)
Theoretical Computer Science
Embedding a family of disjoint 3D meshes into a crossed cube
Information Sciences: an International Journal
Embedding a family of disjoint multi-dimensional meshes into a crossed cube
Information Processing Letters
Fault-tolerant embedding of paths in crossed cubes
Theoretical Computer Science
Conditional fault diameter of crossed cubes
Journal of Parallel and Distributed Computing
Embedding a family of 2D meshes into Möbius cubes
WSEAS Transactions on Mathematics
Embedding fault-free cycles in crossed cubes with conditional link faults
The Journal of Supercomputing
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Paths in Möbius cubes and crossed cubes
Information Processing Letters
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Embedding a long fault-free cycle in a crossed cube with more faulty nodes
Information Processing Letters
Embedding meshes/tori in faulty crossed cubes
Information Processing Letters
A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube
Information Sciences: an International Journal
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Research on petersen graphs and hyper-cubes connected interconnection networks
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Edge-pancyclicity of twisted cubes
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Embedding a mesh of trees in the crossed cube
Information Processing Letters
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
Journal of Parallel and Distributed Computing
Hi-index | 0.90 |
The crossed cube CQn introduced by Efe has many properties similar to those of the popular hypercube. However, the diameter of CQn is about one half of that of the hypercube. Failures of links and nodes in an interconnection network are inevitable. Hence, in this paper, we consider the hybrid fault-tolerant capability of the crossed cube. Letting fe and fv be the numbers of faulty edges and vertices in CQn, we show that a cycle of length l, for any 4 ≤ l ≤ |V(CQn)| - fv, can be embedded into a wounded crossed cube as long as the total number of faults (fv + fv) is no more than n - 2, and we say that CQn is (n - 2)-fault-tolerant pancyclic. This result is optimal in the sense that if there are n - 1 faults, there is no guarantee of having a cycle of a certain length in it.