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 条
  • [41] 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
  • [42] COMPLETELY INDEPENDENT SPANNING TREES IN (PARTIAL) k-TREES
    Matsushita, Masayoshi
    Otachi, Yota
    Araki, Toru
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2015, 35 (03) : 427 - 437
  • [43] Finding independent spanning trees in partial k-trees
    Zhou, X
    Nishizeki, T
    ALGORITHM AND COMPUTATION, PROCEEDINGS, 2001, 1969 : 168 - 179
  • [44] Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
    Kao, Shih-Shun
    Pai, Kung-Jui
    Hsieh, Sun-Yuan
    Wu, Ro-Yu
    Chang, Jou-Ming
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 38 (03) : 972 - 986
  • [45] Independent spanning trees on WK-recursive networks and WK-recursive pyramids
    Fu-Hsing Wang
    Shuo-I Wang
    The Journal of Supercomputing, 2022, 78 : 9879 - 9906
  • [46] 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
  • [47] Optimal Independent Spanning Trees on Odd Graphs
    Jong-Seok Kim
    Hyeong-Ok Lee
    Eddie Cheng
    László Lipták
    The Journal of Supercomputing, 2011, 56 : 212 - 225
  • [48] 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
  • [49] Completely Independent Spanning Trees in Line Graphs
    Hasunuma, Toru
    GRAPHS AND COMBINATORICS, 2023, 39 (05)
  • [50] Independent Spanning Trees in RTCC-Pyramids
    Wang, Shuo-I
    Wang, Fu-Hsing
    COMPUTER JOURNAL, 2017, 60 (01): : 13 - 26
12345