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 条
  • [31] SPANNING BALANCED TREES IN BOOLEAN CUBES
    HO, CT
    JOHNSSON, SL
    SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1989, 10 (04): : 607 - 630
  • [32] EMBEDDING BINARY-TREES INTO CROSSED CUBES
    KULASINGHE, P
    BETTAYEB, S
    IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (07) : 923 - 929
  • [33] Constructing independent spanning trees with height n on the n-dimensional crossed cube
    Cheng, Baolei
    Fan, Jianxi
    Lyu, Qiang
    Zhou, Jingya
    Liu, Zhao
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2018, 87 : 404 - 415
  • [34] ON INDEPENDENT SPANNING-TREES
    KHULLER, S
    SCHIEBER, B
    INFORMATION PROCESSING LETTERS, 1992, 42 (06) : 321 - 323
  • [35] Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees
    Darties, Benoit
    Gastineau, Nicolas
    Togni, Olivier
    DISCRETE APPLIED MATHEMATICS, 2018, 236 : 124 - 136
  • [36] Constructing edge-disjoint spanning trees in twisted cubes
    Yang, Ming-Chien
    INFORMATION SCIENCES, 2010, 180 (20) : 4075 - 4083
  • [37] Optimal independent spanning trees on hypercubes
    Tang, SM
    Wang, YL
    Leu, YH
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2004, 20 (01) : 143 - 155
  • [38] Independent Spanning Trees in Networks: A Survey
    Cheng, Baolei
    Wang, Dajin
    Fan, Jianxi
    ACM COMPUTING SURVEYS, 2023, 55 (14S)
  • [39] Independent Spanning Trees on Folded Hypercubes
    Yang, Jinn-Shyong
    Chang, Jou-Ming
    Chan, Hung-Chang
    2009 10TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS, AND NETWORKS (ISPAN 2009), 2009, : 601 - +
  • [40] Independent spanning trees of chordal rings
    Iwasaki, Y
    Kajiwara, Y
    Obokata, K
    Igarashi, Y
    INFORMATION PROCESSING LETTERS, 1999, 69 (03) : 155 - 160
12345