Communications of the ACM - Special section on computer architecture
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Resource Placement in Torus-Based Networks
IEEE Transactions on Computers
Efficient generation of the binary reflected gray code and its applications
Communications of the ACM
Pancyclicity of recursive circulant graphs
Information Processing Letters
Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes
IEEE Transactions on Computers
Uniform Approach for Solving some Classical Problems on a Linear Array
IEEE Transactions on Parallel and Distributed Systems
On Balancing Sorting on a Linear Array
IEEE Transactions on Parallel and Distributed Systems
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
Hamiltonian properties on the class of hypercube-like networks
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Edge-pancyclicity of Möbius cubes
Information Processing Letters
Task assignment in heterogeneous computing systems
Journal of Parallel and Distributed Computing
Node-pancyclicity and edge-pancyclicity of hypercube variants
Information Processing Letters
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Sciences: an International Journal
The m-pancycle-connectivity of a WK-Recursive network
Information Sciences: an International Journal
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
Many-to-many disjoint paths in faulty hypercubes
Information Sciences: an International Journal
The triangular pyramid: Routing and topological properties
Information Sciences: an International Journal
On the k-tuple domination of generalized de Brujin and Kautz digraphs
Information Sciences: an International Journal
Reordering columns for smaller indexes
Information Sciences: an International Journal
Information Sciences: an International Journal
Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
Information Sciences: an International Journal
The 2-path-bipanconnectivity of hypercubes
Information Sciences: an International Journal
Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes
Information and Computation
Nonflat surface level pyramid: a high connectivity multidimensional interconnection network
The Journal of Supercomputing
Hi-index | 0.08 |
Paths and cycles are popular interconnection networks due to their simplicity and low degrees, and therefore an efficient way of embedding them into an interconnection network is of particular importance. Many path-embedding aspects and cycle-embedding aspects, such as Hamiltonicity, Hamiltonian-connectivity, panconnectivity, bipanconnectivity, pancyclicity, vertex-pancyclicity and edge-pancyclicity, have been proposed and extensively studied. In fact, these discussions are meaningful for interconnection networks of resource-allocated systems or heterogeneous computing systems. In this paper, we propose a new cycle-embedding aspect called bipancycle-connectivity that combines the concepts of vertex-pancyclicity and bipanconnectivity. A bipartite graph is bipancycle-connected if an arbitrary pair of vertices x, y is contained by common cycles called bipanconnected cycles that include a cycle of every even length ranging from minc(x, y) to N; where minc(x, y) denotes the length of the minimum cycle that contains x and y, and N is the number of vertices. In this paper, we introduce a new graph called the cycle-of-ladders. We show that the hypercube is bipancycle-connected by presenting algorithms to embed the cycle-of-ladders into the hypercube.