On the Independent Spanning Trees of Recursive Circulant Graphs G(cd^m, d) with d > 2
Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, and Yue-Li Wang
Theoretical Computer Science, Vol. 410, No. 21-23, (2009) pp. 2001-2010.

The above article has been cited by the articles listed below.
  1. Shyue-Ming Tang, Jinn-Shyong Yang, Yue-Li Wang, Jou-Ming Chang, Independent Spanning Trees on Multidimensional Torus Networks, IEEE Transactions on Computers 59 (2010) 93-102. (*)

  2. Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang, Constructing multiple independent spanning trees on recursive circulant graphs G(2^m,2), International Journal of Foundations of Computer Science 21 (2010) 73-90. (*)

  3. Jinn-Shyong Yang, Jou-Ming Chang, Hung-Chang Chan, Independent spanning trees on folded hypercubess, Proceedings of the 10th International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN 2009), Kaoshiung, Taiwan, Dec. 14-16, 2009, pp. 601-605.(*)

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

  5. Ming-Chien Yang, Constructing edge-disjoint spanning trees in twisted cubes, Information Sciences 180 (2010) 4075-4083. (*)

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

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

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

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

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

  11. Sook-Yeon Kim, Jae-Ha Lee, Jung-Heum Park, Disjoint path covers in recursive circulants G(2^m, 4) with faulty elements, Theoretical Computer Science 412 (2011) 4636-4649. (*)

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

  13. Toru Hasunuma, Chie Morisaka, Completely independent spanning trees in torus networks, Networks 60 (2012) 59-69. (*)

  14. Ming-Chien Yang, Conditional diagnosability of matching composition networks under the MM* model, Information Sciences 233 (2013) 230-243. (*)

  15. Baolei Cheng, Jianxi Fan, Xiaohua Jia, Shukui Zhang, Independent spanning trees in crossed cubes, Information Sciences 233 (2013) 276-289. (*)

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

  17. Sook-Yeon Kim, Jung-Heum Park, Paired many-to-many disjoint path covers in recursive circulants G(2^m,4), IEEE Transactions on Computers 62 (2013) 2468-2475. (*)

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

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

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

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

  22. Eduardo Sant'Ana da Silvá, Andre Luiz Pires Guedes, Eduardo Todt, Independent spanning trees on systems-on-chip hypercubes routing, International Scholarly and Scientific Research & Innovation 7(3) (2013) 494-497.

  23. Baolei Cheng, Jianxi Fan, Xiaohua Jia, Dimensional-permutation-based independent spanning trees in bijective connection networks, IEEE Transactions on Parallel and Distributed Systems 26 (2015) 45-53. (*)

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

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

  26. Toru Hasunuma, Structural properties of subdivided-line graphs, Journal of Discrete Algorithms 31 (2015) 69-86. (*)

  27. Eduardo Sant'Ana da Silva, Helio Pedrini, Inferring patterns in mitochondrial DNA sequences through hypercube independent spanning trees, Computers in Biology and Medicine 70 (2016) 51-57. (*)

  28. Eduardo Sant'Ana da Silva, Helio Pedrini, Connected-component labeling based on hypercubes for memory constrained scenarios, Expert System with Applications 61 (2016) 272-281. (*)

  29. Shuo-I Wang, Fu-Hsing Wang, Independent Spanning Trees in RTCC-Pyramids, The Computer Journal 60 (2017) 13-26. (*)

  30. Yan Wang, Hong Shen, Jianxi Fan, Edge-independent spanning trees in augmented cubes, Theoretical Computer Science 670 (2017) 23-32. (*)

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

  32. Bao-lei Cheng, Ting Pan, Jian-xi Fan, Jing-ya Zhou, Zhao Liu, A secure message transmission scheme in an extended network of crossed cubes, Proceedings of International Conference on Computer Networks and Communication Technology (CNCT 2016), Advances in Computer Science Research 54 (2017) 757-764. (*)

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

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

  35. Baolei Cheng, Jianxi Fan, Cheng-Kuan Lin, Yan Wang, Guijuan Wang, An improved algorithm to construct edge-independent spanning trees in augmented cubes, Discrete Applied Mathematics 277 (2020) 55-70. (*)

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

  37. Baolei Cheng, Jianxi Fan, Qiang Lyu, Cheng-Kuan Lin, Xiaoyan Li, Gul Chen, Constructing node-independent spanning trees in augmented cubes, Fundamenta Informaticae 176 (2020) 103-128. (*)

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

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

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

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

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