期刊
INFORMATION PROCESSING LETTERS
卷 110, 期 14-15, 页码 580-584出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2010.05.004
关键词
Interconnection networks; Hypercubes; Disjoint paths; Parallel computing
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. In this paper, we investigate the problem of many-to-many unpaired n-disjoint path covers in the n-dimensional hypercube Q(n) and obtain the following result. For any two sets S and T of n vertices in different parts, Q(n) has many-to-many unpaired n-disjoint (S, T)-path covers except the case that there exists a vertex v such that N-Qn (v) = S and v is not an element of T or N-Qn (v) = T and v is not an element of S. (C) 2010 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据