The above article has been cited by the articles listed below.
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, 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.(*) David Kocik,
Routing in Möbius Cubes ,
Master Thesis, Czech Technical University in Prague, 30th June 2016. Yan Wang, Hong Shen, Jianxi Fan,
Edge-independent spanning trees in augmented cubes ,
Theoretical Computer Science 670 (2017) 23-32.(*) 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.(*) 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.(*) Zaid Hussain, Bader AlBdaiwi, Anton Cerny,
Node-independent spanning trees in Gaussian networks ,
Journal of Parallel and Distributed Computing 109 (2017) 324-332.(*) Shih-Shun Kao, Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Shyue-Ming Tang, Ro-Yu Wu,
A parallel construction of vertex-disjoint spanning trees with optimal heights in star networks ,
11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017), Shanghai, China, Dec. 16-18, 2018, Lecture Notes in Computer Science, vol. 10627, Part I, pp. 41-55.(*) Benoit Darties, Nicolas Gastineau, Olivier Togni,
Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees ,
Discrete Applied Mathematics 236 (2018) 124-136.(*) Baolei Cheng, Jianxi Fan, Qiang Lyu, Jingya Zhou, Zhao Liu,
Constructing independent spanning trees with height n on the n-dimensional crossed cube ,
Future Generation Computer Systems 87 (2018) 404-415.(*) Dun-Wei Cheng, Chin-Te Chan, Sun-Yuan Hsieh,
Constructing independent spanning trees on pancake networks ,
IEEE Access 8 (2020) 3427-3433.(*) Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang,
A protection routing with secure mechanism in Mobius cubess ,
Journal of Parallel and Distributed Computing 140 (2020) 1-12.(*) 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.(*) 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. Dongqin Cheng,
Hamiltonian cycles passing through prescribed edges in locally twisted cubes ,
Journal of Interconnection Networks 22(2) (2022) Art. 2150020.(*) Zaid Hussain, Hosam AboElFotoh, Bader AlBdaiwi,
Independent spanning trees in Eisenstein-Jacobi networks ,
The Journal of Supercomputing 78(10) (2022) 12114-12135.(*) Zhiyong Pan, Baolei Cheng, Jianxi Fan, Yan Wang, Xiajing Li,
A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks ,
Theoretical Computer Science 942 (2023) 33-46.(*) 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: 18