Two Methods for Constructing Independent Spanning Trees in Alternating Group Networks

被引：0
|
作者：
Huang, Jie-Fu [1 ]
Hsieh, Sun-Yuan [1 ]
机构：
[1] Natl Cheng Kung Univ, Dept Comp Sci & Informat Engn, Tainan, Taiwan
来源：
COMPANION OF THE 2020 IEEE 20TH INTERNATIONAL CONFERENCE ON SOFTWARE QUALITY, RELIABILITY, AND SECURITY (QRS-C 2020) | 2020年
关键词：
Independent spanning trees; Alternating group networks; Recursive algorithm; Parallel algorithm; Triangle breadth-first search;
D O I：
10.1109/QRS-051114.2020.00105
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
In this paper, we propose a recursive and a parallel algorithms, respectively, for constructing independent spanning trees in alternating group networks. The recursive algorithm is BFS-based, while the parallel algorithm is BFS-based and rule-based. Both algorithms are accurate, and furthermore, the parallel algorithm is more efficient than the recursive one.
引用
收藏
页码：616 / 621
页数：6
相关论文
共 50 条
  • [1] Constructing Independent Spanning Trees in Alternating Group Networks
    Huang, Jie-Fu
    Hsieh, Sun-Yuan
    COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 198 - 209
  • [2] Recursive and parallel constructions of independent spanning trees in alternating group networks
    Huang, Jie-Fu
    Hsieh, Sun-Yuan
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS- COMPUTER SYSTEMS THEORY, 2020, 5 (04) : 234 - 262
  • [3] Constructing Independent Spanning Trees on Pancake Networks
    Cheng, Dun-Wei
    Chan, Chih-Te
    Hsieh, Sun-Yuan
    IEEE ACCESS, 2020, 8 : 3427 - 3433
  • [4] Constructing Independent Spanning Trees on Transposition Networks
    Lin, Chien-Fu
    Huang, Jie-Fu
    Hsieh, Sun-Yuan
    IEEE ACCESS, 2020, 8 : 147122 - 147132
  • [5] 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
  • [6] Constructing two completely independent spanning trees in hypercube-variant networks
    Pai, Kung-Jui
    Chang, Jou-Ming
    THEORETICAL COMPUTER SCIENCE, 2016, 652 : 28 - 37
  • [7] Constructing Independent Spanning Trees on Bubble-Sort Networks
    Kao, Shih-Shun
    Chang, Jou-Ming
    Pai, Kung-Jui
    Wu, Ro-Yu
    COMPUTING AND COMBINATORICS (COCOON 2018), 2018, 10976 : 1 - 13
  • [8] Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes
    Yang, Yi-Xian
    Pai, Kung-Jui
    Chang, Ruay-Shiung
    Chang, Jou-Ming
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2019, E102D (12) : 2409 - 2412
  • [9] Two algorithms for constructing independent spanning trees in (n,k)-star graphs
    Huang, Jie-Fu
    Cheng, Eddie
    Hsieh, Sun-Yuan
    IEEE Access, 2020, 8 : 175932 - 195947
  • [10] Two Algorithms for Constructing Independent Spanning Trees in (n,k)-Star Graphs
    Huang, Jie-Fu
    Cheng, Eddie
    Hsieh, Sun-Yuan
    IEEE ACCESS, 2020, 8 : 175932 - 175947
12345