The above article has been cited by the articles listed below.
Yu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang,
Parallel construction of independent spanning trees on parity cubes ,
Proceedings of IEEE 17th International Conference on Computational Science and Engineering (CSE 2014),
Chengdu, China, Dec. 19-21, 2014, pp. 1150-1154.
(*)
Jou-Ming Chang, Jhen-Ding Wang, Jinn-Shyong Yang, Kung-Jui Pai,
A comment on "Independent spanning trees in crossed cubes" ,
Information Processing Letters 114 (2014) 734-739.
(*)
Jinn-Shyong Yang, Meng-Ru Wu, Jou-Ming Chang, Yu-Huei Chang,
A fully parallelized scheme of constructing independent spanning trees on Möbius cubes ,
Journal of Supercomputing 71 (2015) 894-908.
(*)
Yu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang,
A fast parallel algorithm for constructing independent spanning trees on parity cubes ,
Applied Mathematics and Computation 268 (2015) 489-495.
(*)
Jinn-Shyong Yang, Jou-Ming Chang, Kung-Jui Pai, Hung-Chang Chan,
Parallel construction of independent spanning trees on enhanced hypercubes ,
IEEE Transactions on Parallel and Distributed Systems 26 (2015) 3090-3098.
(*)
Jinn-Shyong Yang, Sih-Syuan Luo, Jou-Ming Chang,
Pruning longer branches of independent spanning trees on folded hyper-stars ,
The Computer Journal 58 (2015) 2972-2981.
(*)
Bader AlBdaiwi, Zaid Hussain, Anton Cerny, Robert Aldred,
Edge-disjoint node-independent spanning trees in dense Gaussian networks ,
Journal of Supercomputing 72 (2016) 4718-4736.
(*)
Yu-Huei Chang, Jinn-Shyong Yang, Sun-Yuan Hsieh, Jou-Ming Chang, Yue-Li Wang,
Construction independent spanning trees on locally twisted cubes in parallel ,
Journal of Combinatorial Optimization 33 (2017) 956-967.
(*)
Jou-Ming Chang, Ting-Jyun Yang, Jinn-Shyong Yang,
A parallel algorithm for constructing independent spanning trees in twisted cubes ,
Discrete Applied Mathematics 219 (2017) 74-82.
(*)
Eduardo Sant'Ana da Silva, Helio Pedrin,
Embedded hypercube graph applied to image analysis Problems ,
Journal of Signal Processing Systems 88 (2017) 453-462.
(*)
Zaid Hussain, Bader AlBdaiwi, Anton Cerny,
Node-independent spanning trees in Gaussian networks ,
Journal of Parallel and Distributed Computing 109 (2017) 324-332.
(*)
Klaus-Tycho Foerster, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Tredan,
CASA: congestion and stretch aware static fast rerouting ,
IEEE INFOCOM 2019 , Paris, France, Apr. 2019, art. no. 8737438, pp. 469-477.
(*)
Yi-Cheng Yang, Shin-Shun Kao, Ralf Klasing, Sun-Yuan Hsieh, Hsin-Hung Chou, Jou-Ming Chang,
The construction of multiple independent spanning trees on burnt pancake networks ,
IEEE Access 9 (2021) 16679-16691.
(*)
Ningning Liu, Yujie Zhang, Weibei Fan
Construction of completely independent spanning tree based on vertex degree ,
Proceedings of International Conference on Parallel and Distributed Computing: Applications and Technologies (IPDCAT 2020), Shenzhen, China, Dec. 28-30, 2020, Lecture Notes in Computer Science, Vol 12606. Springer, Cham. pp. 94-103
Shin-Shun Kao, Ralf Klasing, Ling-Ju Hung, Sun-Yuan Hsieh,
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks ,
Proceedings of 15th International Conference on Algorithmic Aspects in Information and Management (AAIM 2021), LNCS 13153, pp. 252-264, 2021.
Zaid Hussain, Hosam AboElFotoh, Bader AlBdaiwi,
Independent spanning trees in Eisenstein-Jacobi networks ,
The Journal of Supercomputing 78(10) (2022) 12114-12135.
(*)
Suying Wu, Jianxi Fan, Baolei Cheng, Jia Yu, Yan Wang,
Connectivity and constructive algorithms of disjoint paths in dragonfly networks ,
Theoretical Computer Science 922 (2022) 257-270.
(*)
Baolei Cheng, Dajin Wang, Jianxi Fan,
Independent Spanning Trees in Networks - A Survey ,
ACM Computing Surveys 55(14) (2023) 335.
(*)
Shih-Shun Kao, Ralf Klasing, Ling-Ju Hung, Chia-Wei Lee, Sun-Yuan Hsieh,
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks ,
Journal of Parallel and Distributed Computing 181 (2023) 104731.
(*)
Times cited: 17 (from Web of Science)