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 条
  • [41] Independent spanning trees on even networks
    Kim, Jong-Seok
    Lee, Hyeong-Ok
    Cheng, Eddie
    Liptak, Laszlo
    INFORMATION SCIENCES, 2011, 181 (13) : 2892 - 2905
  • [42] Independent spanning trees of product graphs
    Obokata, K
    Iwasaki, Y
    Bao, F
    Igarashi, Y
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1997, 1197 : 338 - 351
  • [43] MINIMAL GRAPHS FOR COMPLETELY INDEPENDENT SPANNING TREES AND COMPLETELY INDEPENDENT SPANNING TREES IN COMPLETE T-PARTITE GRAPH
    Hong, Xia
    Gao, Feng
    Wu, Zengbao
    CONTRIBUTIONS TO DISCRETE MATHEMATICS, 2024, 19 (02) : 23 - 35
  • [44] COMPLETELY INDEPENDENT SPANNING TREES IN (PARTIAL) k-TREES
    Matsushita, Masayoshi
    Otachi, Yota
    Araki, Toru
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2015, 35 (03) : 427 - 437
  • [45] Finding independent spanning trees in partial k-trees
    Zhou, X
    Nishizeki, T
    ALGORITHM AND COMPUTATION, PROCEEDINGS, 2001, 1969 : 168 - 179
  • [46] Constructing edge-disjoint spanning trees in locally twisted cubes
    Hsieh, Sun-Yuan
    Tu, Chang-Jen
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (8-10) : 926 - 932
  • [47] Constructing Independent Spanning Trees on Transposition Networks
    Lin, Chien-Fu
    Huang, Jie-Fu
    Hsieh, Sun-Yuan
    IEEE ACCESS, 2020, 8 : 147122 - 147132
  • [48] Optimal Independent Spanning Trees on Odd Graphs
    Kim, Jong-Seok
    Lee, Hyeong-Ok
    Cheng, Eddie
    Liptak, Laszl
    JOURNAL OF SUPERCOMPUTING, 2011, 56 (02): : 212 - 225
  • [49] Completely independent spanning trees in torus networks
    Hasunuma, Toru
    Morisaka, Chie
    NETWORKS, 2012, 60 (01) : 59 - 69
  • [50] Independent spanning trees in Eisenstein–Jacobi networks
    Zaid Hussain
    Hosam AboElFotoh
    Bader AlBdaiwi
    The Journal of Supercomputing, 2022, 78 : 12114 - 12135
12345