Pruning Longer Branches of Independent Spanning Trees on Folded Hyper-Stars
Jinn-Shyong Yang, Sih-Syuan Luo, and Jou-Ming Chang
The Computer Journal, Vol. 58, No. 11, (2015) pp. 2972-2981.

The above article has been cited by the articles listed below.
  1. Kung-JuiPai, Jou-Ming Chang, Constructing two completely independent spanning trees in hypercube-variant networks, Theoretical Computer Science 652 (2016) 28-37. (*)

  2. 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, COCOA 2017, Part I, Lecture Notes in Computer Science 10627 (2017) 41-55.(*)

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

  4. Jou-Ming Chang, Jinn-Shyong Yang, Shyue-Ming Tang, Kung-JuiPai, The wide diameters of regular hyper-stars and folded hyper-stars, The Computer Journal 61 (2018) 121-128. (*)

  5. Kung-Jui Pai, Jou-Ming Chang, Improving the diameters of completely independent spanning trees in locally twisted cubes, Information Processing Letters 141 (2019) 22-24. (*)

  6. Yo Nishiyama, Yuko Sasaki, Yuki Hirai, Hironori Nakajo, Keiichi Kaneko, Fault-tolerant routing based on routing capabilities in a hyper-star graph, Journal of Information Science and Engineering 34 (2018) 1353-1366. (*)

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

  8. Yu-Han Chen, Shyue-Ming Tang, Kung-Jui Pai, Jou-Ming Chang, Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes, Theoretical Computer Science 878-879 (2021) 102-112. (*)

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

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

  11. 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: 10 (from Web of Science)