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 条

[41] Completely independent spanning trees in Eisenstein-Jacobi networks
Hussain, Zaid
AlAzemi, Fawaz
AlBdaiwi, Bader
JOURNAL OF SUPERCOMPUTING, 2024, 80 (11): : 15105 - 15121
[42] Towards the Independent Spanning Trees in the Line Graphs of Interconnection Networks
Cheng, Baolei
Fan, Jianxi
Li, Xiaoyan
Wang, Guijuan
Zhou, Jingya
Han, Yuejuan
ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2018, PT III, 2018, 11336 : 342 - 354
[43] Completely Independent Spanning Trees in the Line Graphs of Torus Networks
Bian, Qingrong
Cheng, Baolei
Fan, Jianxi
Pan, Zhiyong
ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2021, PT III, 2022, 13157 : 540 - 553
[44] The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks
Yang, Yi-Cheng
Kao, Shih-Shun
Klasing, Ralf
Hsieh, Sun-Yuan
Chou, Hsin-Hung
Chang, Jou-Ming
IEEE ACCESS, 2021, 9 (09): : 16679 - 16691
[45] Fault Tolerance for Hypercube Networks Via Independent Spanning Trees
Umrao, Lokendra Singh
Mahato, Dharmendra Prasad
Singh, Ravi Shankar
2014 INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED AND GRID COMPUTING (PDGC), 2014, : 191 - 195
[46] Constructing spanning trees in augmented cubes
Mane, S. A.
Kandekar, S. A.
Waphare, B. N.
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2018, 122 : 188 - 194
[47] ON INDEPENDENT SPANNING-TREES
KHULLER, S
SCHIEBER, B
INFORMATION PROCESSING LETTERS, 1992, 42 (06) : 321 - 323
[48] Constructing Completely Independent Spanning Trees in Data Center Network Based on Augmented Cube
Chen, Guo
Cheng, Baolei
Wang, Dajin
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2021, 32 (03) : 665 - 673
[49] 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
[50] Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks
Khan, Maleq
Pandurangan, Gopal
Kumar, V. S. Anil
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2009, 20 (01) : 124 - 139

← 1 2 3 4 5 →