期刊
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
卷 23, 期 6, 页码 1081-1089出版社
IEEE COMPUTER SOC
DOI: 10.1109/TPDS.2011.245
关键词
Cartesian product networks; cycle embedding; generalized hypercubes; nearest neighbor mesh hypercubes; pancycle problem; panconnectivity problem; path embedding
In this paper, we consider two embedding problems in Cartesian product networks: one is the pancycle problem, which involves embedding cycles of various lengths in the given product network; and the other is the panconnectivity problem, which involves embedding paths of various lengths between any pair of distinct nodes in the given product network. We then apply our technical lemmas and theorems to derive new topological properties of two multiprocessor systems, namely, generalized hypercubes and nearest neighbor mesh hypercubes.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据