Independent spanning trees in crossed cubes

被引：7
|
作者：
Zhang, Yan-Hong [1 ]
Hao, Wei [1 ]
Xiang, Tao [2 ]
机构：
[1] Henan Univ Urban Construct, Dept Comp Sci & Engn, Pingdingshan 467036, Henan, Peoples R China
[2] Chongqing Univ, Coll Comp Sci, Chongqing 400044, Peoples R China
来源：
INFORMATION PROCESSING LETTERS | 2013年 / 113卷 / 18期
关键词：
Interconnection networks; Crossed cubes; Independent spanning trees; Algorithms; Fault-tolerance; HYPERCUBES; PATH;
D O I：
10.1016/j.ipl.2013.06.004
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper addresses the independent spanning trees (ISTs) problem in crossed cubes. The algorithm proposed in this paper generates n ISTs for an n-dimensional crossed cube (CQ(n)). This algorithm takes time O (N log N) and can be parallelized to run in time O (log N), where N = 2(n) is the number of the nodes in CQ(n). To the best of our knowledge, this is the first algorithm which can parallelly construct the ISTs in crossed cubes. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码：653 / 658
页数：6
相关论文
共 50 条
  • [1] Independent spanning trees in crossed cubes
    Cheng, Baolei
    Fan, Jianxi
    Jia, Xiaohua
    Zhang, Shukui
    INFORMATION SCIENCES, 2013, 233 : 276 - 289
  • [2] A comment on "Independent spanning trees in crossed cubes"
    Chang, Jou-Ming
    Wang, Jhen-Ding
    Yang, Jinn-Shyong
    Pai, Kung-Jui
    INFORMATION PROCESSING LETTERS, 2014, 114 (12) : 734 - 739
  • [3] Constructing completely independent spanning trees in crossed cubes
    Cheng, Baolei
    Wang, Dajin
    Fan, Jianxi
    DISCRETE APPLIED MATHEMATICS, 2017, 219 : 100 - 109
  • [4] Edge-independent spanning trees in folded crossed cubes
    Zhang, Huanwen
    Wang, Yan
    Fan, Jianxi
    Shu, Chang
    THEORETICAL COMPUTER SCIENCE, 2023, 970
  • [5] Parallel Construction of Independent Spanning Trees on Folded Crossed Cubes
    Zhang, Huanwen
    Wang, Yan
    Fan, Jianxi
    Guo, Ruyan
    2021 IEEE 32ND INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES AND PROCESSORS (ASAP 2021), 2021, : 207 - 210
  • [6] Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
    Cheng, Baolei
    Fan, Jianxi
    Jia, Xiaohua
    Wang, Jin
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2013, 73 (05) : 641 - 652
  • [7] Independent spanning trees on twisted cubes
    Wang, Yan
    Fan, Jianxi
    Zhou, Guodong
    Jia, Xiaohua
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2012, 72 (01) : 58 - 69
  • [8] Three completely independent spanning trees of crossed cubes with application to secure-protection routing
    Pai, Kung-Jui
    Chang, Ruay-Shiung
    Wu, Ro-Yu
    Chang, Jou-Ming
    INFORMATION SCIENCES, 2020, 541 : 516 - 530
  • [9] Constructing independent spanning trees for locally twisted cubes
    Liu, Yi-Jiun
    Lan, James K.
    Chou, Well Y.
    Chen, Chiuyuan
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (22) : 2237 - 2252
  • [10] Constructive Algorithm of Independent Spanning Trees on Mobius Cubes
    Cheng, Baolei
    Fan, Jianxi
    Jia, Xiaohua
    Zhang, Shukui
    Chen, Bangrui
    COMPUTER JOURNAL, 2013, 56 (11): : 1347 - 1362
12345