The above article has been cited by the articles listed below.
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, Ro-Yu Wu,
Constructing independent spanning trees on Bbubble-sort networks ,
24th International Computing and Combinatorics Conference (COCOON 2018), Qingdao, China, July 2¡V4, 2018, Lecture Notes in Computer Science, vol. 10976, pp. 1-13.(*) 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.(*) Shih-Shun Kao, Kung-Jui Pai, Sun-Yuan Hsieh, Ro-Yu Wu, Jou-Ming Chang,
Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks ,
Journal of Combinatorial Optimization 38(3) (2019) 972-986.(*) Dun-Wei Cheng, Chin-Te Chan, Sun-Yuan Hsieh,
Constructing independent spanning trees on pancake networks ,
IEEE Access 8 (2020) 3427-3433.(*) 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.(*) Jie-Fu Huang, Shih-Shun Kao, Sun-Yuan Hsieh, Ralf Klasing,
Top-down construction of independent spanning trees in alternating group networks ,
IEEE Access 8 (2020) 112333-112347.(*) Chien-Fu Lin, Jie-Fu Huang, Sun-Yuan Hsieh,
Constructing independent spanning trees on transposition networks ,
IEEE Access 8 (2020) 147122-147132.(*) Jie-Fu Huang, Sun-Yuan Hsieh,
Recursive and parallel constructions of independent spanning trees in alternating group networks ,
International Journal of Computer Mathematics: Computer Systems Theory 5 (2020) 234-262.(*) Jie-Fu Huang, Sun-Yuan Hsieh,
Constructing independent spanning trees in alternating group networks ,
Proceedings of 26th International Conference on Computing and Combinatorics (COCOON 2020) , 29-31 Aug. 2020, Atlanta, GA, USA, LNCS 12273, pp. 198-209.(*) Jie-Fu Huang, Eddie Cheng, Sun-Yuan Hsieh,
Two algorithms for constructing independent spanning trees in (n,k)-star graphs ,
IEEE Access 8 (2020) 175932-175947.(*) Tzu-Liang Kung, Hon-Chan Chen, Chia-Hui Lin, Lih-Hsing Hsu,
Three types of two-disjoint-cycle-cover pancyclicity and their applications to cycle embedding in locally twisted cubes ,
Computer Journal 64 (2021) 27-37.(*) 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,
Embedding mutually edge-disjoint cycles into locally twisted cubes ,
Theoretical Computer Science 929 (2022) 11-17.(*) 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.(*) Bai Yin, Qianru Zhou, Hai Liu, Yan Wang, Baolei Cheng, Jianxi Fan,
Unpaired set-to-set disjoint path routings in recursive match networks ,
Theoretical Computer Science 1032 (2025) 115111.(*)
Times cited: 17