A Parallel Algorithm for Constructing Independent Spanning Trees in Twisted Cubes
Jou-Ming Chang, Ting-Jyun Yang, and Jinn-Shyong Yang
Discrete Applied Mathematics, Vol. 219, (2017) pp. 74-82.

The above article has been cited by the articles listed below.
  1. Zaid Hussain, Bader AlBdaiwi, Anton Cerny, Node-independent spanning trees in Gaussian networks, Journal of Parallel and Distributed Computing 109 (2017) 324-332. (*)

  2. Litao Guo, Reliability analysis of twisted cubes, Theoretical Computer Science 707 (2018) 96-101. (*)

  3. 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. (*)

  4. Dongqin Cheng, Cycles embedding in balanced hypercubes with faulty edges, Discrete Applied Mathematics 238 (2018) 56-69. (*)

  5. 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-4, 2018, Lecture Notes in Computer Science, vol. 10976, pp. 1-13. (*)

  6. Dongfang Zhou, Jianxi Fan, Jingya Zhou, Yan Wang, Baolei Cheng, Diagnosability of the exchanged crossed cube, International Journal of Computer Mathematics: Computer Systems Theory 3 (2018) 53-63.

  7. 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. (*)

  8. Baolei Cheng, Jianxi Fan, Cheng-Kuan Lin, Xiaohua Jia, Xiaoyan Li, Constructing node-independent spanning trees on the line graph of the hypercube by an independent forest scheme, Journal of Parallel and Distributed Computing 134 (2019) 104-115. (*)

  9. Dun-Wei Cheng, Chin-Te Chan, Sun-Yuan Hsieh, Constructing independent spanning trees on pancake networks, IEEE Access 8 (2020) 3427-3433. (*)

  10. Chien-Fu Lin, Jie-Fu Huang, Sun-Yuan Hsieh, Constructing independent spanning trees on transposition networks, IEEE Access 8 (2020) 147122-147132. (*)

  11. 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. (*)

  12. 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. (*)

  13. 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. (*)

  14. 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.

  15. Dongqin Cheng, Hamiltonian cycles passing through prescribed edges in locally twisted cubes, Journal of Interconnection Networks 22(2) (2022) Art. 2150020. (*)

  16. Zaid Hussain, Hosam AboElFotoh, Bader AlBdaiwi, Independent spanning trees in Eisenstein-Jacobi networks, The Journal of Supercomputing 78(10) (2022) 12114-12135. (*)

  17. Hiroyuki Ichida, Keiichi Kaneko, Set-to-set aisjoint paths problem in Mobius cubes, IEEE Access 10 (2022) 83075-83084. (*)

  18. Baolei Cheng, Dajin Wang, Jianxi Fan, Independent Spanning Trees in Networks - A Survey, ACM Computing Surveys 55(14) (2023) 335. (*)

  19. 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. (*)

  20. Qi He, Yan Wang, Jianxi Fan, Baolei Cheng, Vertex-independent spanning trees in complete Josephus cubes, Theoretical Computer Science 1025 (2025) 114969. (*)

Times cited: 18 (from Web of Science)