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 条

[31] Completely Independent Spanning Trees on Some Interconnection Networks
Pai, Kung-Jui
Yang, Jinn-Shyong
Yao, Sing-Chen
Tang, Shyue-Ming
Chang, Jou-Ming
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2014, E97D (09): : 2514 - 2517
[32] Independent spanning trees in Eisenstein-Jacobi networks
Hussain, Zaid
AboElFotoh, Hosam
AlBdaiwi, Bader
JOURNAL OF SUPERCOMPUTING, 2022, 78 (10): : 12114 - 12135
[33] Towards the Independent Spanning Trees in Conditional BC Networks
Cheng, Baolei
Fan, Jianxi
Zhang, Shukui
Wang, Yan
Wang, Xi
Liu, Wenjun
PROCEEDINGS OF THE 2013 INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER SCIENCE AND ELECTRONICS INFORMATION (ICACSEI 2013), 2013, 41 : 79 - 82
[34] Node-independent spanning trees in Gaussian networks
Hussain, Zaid
AlBdaiwi, Bader
Cerny, Anton
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2017, 109 : 324 - 332
[35] Two completely independent spanning trees of split graphs*
Chen, Xiaodong
Liu, Qinghai
Yang, Xiwu
DISCRETE APPLIED MATHEMATICS, 2023, 340 : 76 - 78
[36] Constructing node-independent spanning trees on the line graph of the hypercube by an independent forest scheme
Cheng, Baolei
Fan, Jianxi
Lin, Cheng-Kuan
Jia, Xiaohua
Li, Xiaoyan
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2019, 134 : 104 - 115
[37] Constructing Robust Spanning Trees in Distributed Optical Communication Satellite Networks
Liu, Xianfeng
Wu, Shuai
Chen, Quan
Guo, Jianming
Yang, Lei
Fan, Chengguang
Zhao, Yong
PROCEEDINGS OF THE 2019 12TH IFIP WIRELESS AND MOBILE NETWORKING CONFERENCE (WMNC 2019), 2019, : 111 - 117
[38] An Efficient Distributed Algorithm for Constructing Spanning Trees in Wireless Sensor Networks
Lachowski, Rosana
Pellenz, Marcelo E.
Penna, Manoel C.
Jamhour, Edgard
Souza, Richard D.
SENSORS, 2015, 15 (01) : 1518 - 1536
[39] A fully parallelized scheme of constructing independent spanning trees on Möbius cubes
Jinn-Shyong Yang
Meng-Ru Wu
Jou-Ming Chang
Yu-Huei Chang
The Journal of Supercomputing, 2015, 71 : 952 - 965
[40] Analysis of two sweep-line algorithms for constructing spanning trees and steiner trees
Dumitrescu, Adrian
Toth, Csaba D.
JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2007, 13 (11) : 1615 - 1627

← 1 2 3 4 5 →