Independent spanning trees on even networks

被引：26
|
作者：
Kim, Jong-Seok [2 ]
Lee, Hyeong-Ok [1 ]
Cheng, Eddie [3 ]
Liptak, Laszlo [3 ]
机构：
[1] Sunchon Natl Univ, Dept Comp Educ, Sunchon 540742, Chonnam, South Korea
[2] Yeungnam Univ, Dept Informat & Commun Engn, Kyongsan 712749, Gyeongbuk, South Korea
[3] Oakland Univ, Dept Math & Stat, Rochester, MI 48309 USA
来源：
INFORMATION SCIENCES | 2011年 / 181卷 / 13期
关键词：
Independent spanning trees; Even networks; Internally disjoint paths; Algorithms; SMALL DEPTHS; RELIABILITY; GRAPHS; CYCLES; PATHS;
D O I：
10.1016/j.ins.2011.02.012
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides a number of advantages, including the increase of fault-tolerance and bandwidth. Thus, the designs of multiple ISTs on several classes of networks have been widely investigated. In this paper, we give an algorithm to construct ISTs on even networks, and show that these ISTs are optimal for height and path lengths, and each path in the ISTs has length at most the length of the shortest path+4 in the even network. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码：2892 / 2905
页数：14
相关论文
共 50 条
  • [31] Independent spanning trees in crossed cubes
    Cheng, Baolei
    Fan, Jianxi
    Jia, Xiaohua
    Zhang, Shukui
    INFORMATION SCIENCES, 2013, 233 : 276 - 289
  • [32] 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
  • [33] Independent spanning trees of chordal rings
    Iwasaki, Y
    Kajiwara, Y
    Obokata, K
    Igarashi, Y
    INFORMATION PROCESSING LETTERS, 1999, 69 (03) : 155 - 160
  • [34] Independent spanning trees in crossed cubes
    Zhang, Yan-Hong
    Hao, Wei
    Xiang, Tao
    INFORMATION PROCESSING LETTERS, 2013, 113 (18) : 653 - 658
  • [35] Independent spanning trees of product graphs
    Obokata, K
    Iwasaki, Y
    Bao, F
    Igarashi, Y
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1997, 1197 : 338 - 351
  • [36] Completely Independent Spanning Trees for enhancing the robustness in ad-hoc Networks
    Moinet, Axel
    Darties, Benoit
    Gastineau, Nicolas
    Baril, Jean-Luc
    Togni, Olivier
    2017 IEEE 13TH INTERNATIONAL CONFERENCE ON WIRELESS AND MOBILE COMPUTING, NETWORKING AND COMMUNICATIONS (WIMOB), 2017, : 63 - 70
  • [37] Constructing two completely independent spanning trees in hypercube-variant networks
    Pai, Kung-Jui
    Chang, Jou-Ming
    THEORETICAL COMPUTER SCIENCE, 2016, 652 : 28 - 37
  • [38] Top-Down Construction of Independent Spanning Trees in Alternating Group Networks
    Huang, Jie-Fu
    Kao, Shih-Shun
    Hsieh, Sun-Yuan
    Klasing, Ralf
    IEEE ACCESS, 2020, 8 : 112333 - 112347
  • [39] Parallel construction of multiple independent spanning trees on highly scalable datacenter networks
    Yang, Jinn-Shyong
    Li, Xiao-Yan
    Peng, Sheng-Lung
    Chang, Jou-Ming
    APPLIED MATHEMATICS AND COMPUTATION, 2022, 413
  • [40] Dimensional-Permutation-Based Independent Spanning Trees in Bijective Connection Networks
    Cheng, Baolei
    Fan, Jianxi
    Jia, Xiaohua
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2015, 26 (01) : 45 - 53
12345