Constructing Multiple Independent Spanning Trees on Recursive Circulant Graphs G(2^m, 2)
Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, and Yue-Li Wang
International Journal of Foundations of Computer Science, Vol. 21, No. 1, (2010) pp. 73-90.

The above article has been cited by the articles listed below.
  1. Jia-Cian Lin, Jinn-Shyong Yang, Chiun-Chieh Hsu, Jou-Ming Chang, Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes, Information Processing Letters 109 (2009) 1197-1201. (*)

  2. Jinn-Shyong Yang, Jou-Ming Chang, Independent spanning trees on folded hyper-Stars, Networks 56 (2010) 272-281. (*)

  3. Xie-Bin Chen, Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs, Information Processing Letters 111 (2011) 235-238. (*)

  4. Jinn-Shyong Yang, Hung-Chang Chan, Jou-Ming Chang, Broadcasting secure messages via optimal independent spanning trees in folded hypercubes, Discrete Applied Mathematics 159 (2011) 1254-1263. (*)

  5. Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, László Lipták, Optimal independent spanning trees on odd graphs, The Journal of Supercomputing 56 (2011) 212-225.

  6. Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, László Lipták, Independent spanning trees on even networks, Information Sciences 181 (2011) 2892-2905. (*)

  7. Shyue-Ming Tang, Yue-Li Wang, and Chien-Yi Li, Generalized recursive circulant graphs, IEEE Transactions on Computers 23 (2012) 87-93. (*)

  8. Shyue-Ming Tang, Construct independent spanning trees on chordal rings with multiple chords, Smart Innovation, Systems and Technologies 20 (2013) 481-490.

  9. Baolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Bangrui Chen, Constructive algorithm of independent spanning trees on Möbius cubes, The Computer Journal 56 (2013) 1347-1362. (*)

  10. Xie-Bin Chen, Construction of optimal independent spanning trees on folded hypercubes, Information Sciences 253 (2013) 147-156. (*)

  11. Lokendra Singh Umrao, Dharmendra Prasad Mahato, Ravi Shankar Singh Fault tolerance for hypercube networks via independent spanning trees, Proceedings of the 3rd International Conference on Parallel, Distributed and Grid Computing (PDGC-2014), Himachal Pradesh, India, Dec. 11-13, 2014, pp. 191-195. (*)

  12. Jinn-Shyong Yang, Jou-Ming Chang, Optimal independent spanning trees on Cartesian product of hybrid graphs, The Computer Journal 57 (2014) 93-99. (*)

  13. 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 Supercomputing71 (2015) 894-908. (*)

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

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

  16. Shyue-Ming Tang, Yue-Li Wang, Chien-Yi Li, Jou-Ming Chang, Cycle embedding in generalized recursive circulant graphs, IEICE Transactions on Information and Systems E101-D (2018) 2916-2921. (*)

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

  18. Dun-Wei Cheng, Kai-Hsun Yao, Sun-Yuan Hsieh, Construction independent spanning trees on generalized recursive circulant graphs, IEEE Access 9 (2021) 74028-74037. (*)

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

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

  21. 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 (from Web of Science)