Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
The Twisted N-Cube with Application to Multiprocessing
IEEE Transactions on Computers
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
Topological properties of the crossed cube architecture
Parallel Computing
Fault-tolerant Hamiltonicity of twisted cubes
Journal of Parallel and Distributed Computing
IEEE Transactions on Computers
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
Graph Theory With Applications
Graph Theory With Applications
Many-to-Many disjoint path covers in a graph with faulty elements
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
The diagnosability of the matching composition network under the comparison diagnosis model
IEEE Transactions on Computers
Many-to-many disjoint paths in faulty hypercubes
Information Sciences: an International Journal
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
Information Processing Letters
Many-to-many n-disjoint path covers in n-dimensional hypercubes
Information Processing Letters
Disjoint path covers in recursive circulants G(2m,4) with faulty elements
Theoretical Computer Science
Paired many-to-many disjoint path covers of hypercubes with faulty edges
Information Processing Letters
The paths embedding of the arrangement graphs with prescribed vertices in given position
Journal of Combinatorial Optimization
Paired many-to-many disjoint path covers of the hypercubes
Information Sciences: an International Journal
The 2-path-bipanconnectivity of hypercubes
Information Sciences: an International Journal
| Hi-index | 0.89 |
Embedding of paths have attracted much attention in the parallel processing. Many-to-many communication is one of the most central issues in various interconnection networks. A graph G is globally two-equal-disjoint path coverable if for any two distinct pairs of vertices (u,v) and (w,x) of G, there exist two disjoint paths P and Q satisfied that (1) P (Q, respectively) joins u and v (w and x, respectively), (2) |P|=|Q|, and (3) V(P@?Q)=V(G). The Matching Composition Network (MCN) is a family of networks which two components are connected by a perfect matching. In this paper, we consider the globally two-equal-disjoint path cover property of MCN. Applying our result, the Crossed cube CQ"n, the Twisted cube TQ"n, and the Mobius cube MQ"n can all be proven to be globally two-equal-disjoint path coverable for n=5.