The above article has been cited by the articles listed below.
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.(*) 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.(*) 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.(*) Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang,
A two-stages tree-searching algorithm for finding three completely independent spanning trees ,
Theoretical Computer Science 784 (2019) 65-74.(*) Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang,
Three completely independent spanning trees of crossed cubes with application to secure-protection routing ,
Proceedings of 21st IEEE International Conference on High Performance Computing and Communications (HPCC 2019), Zhangjiajie, China, August 10-12, 2019, art. no. 8855608, pp. 1358-1365. Shuo-I Wang, Fu-Hsing Wang,
Linear time algorithms for finding independent spanning trees on pyramid networks ,
Journal of Combinatorial Optimization 39 (2020) 826-848.(*) Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang,
Three completely independent spanning trees of crossed cubes with application to secure-protection routing ,
Information Sciences 541 (2020) 516-530.(*) 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. Kung-Jui Pai, Ro-Yu Wu, Sheng-Lung Peng, Jou-Ming Chang,
Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting ,
Proceedings of 23rd IEEE International Conference on High Performance Computing and Communications (HPCC 2021), Haikou, Hainan, China, Dec. 20-22, 2021, pp. 377-383. Fu-Hsing Wang, Shuo-I Wang,
Independent spanning trees on WK-recursive networks and WK-recursive pyramids ,
The Journal of Supercomputing 78(7) (2022) 9879-9906.(*) Hiroyuki Ichida, Keiichi Kaneko,
Set-to-set aisjoint paths problem in Mobius cubes ,
IEEE Access 10 (2022) 83075-83084.(*) Kung-Jui Pai, Ro-Yu Wu, Sheng-Lung Peng, Jou-Ming Chang,
Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting ,
The Journal of Supercomputing 79(4) (2023) 4126-4145.(*) 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: 15