` Reducing the Height of Independent Spanning Trees in Chordal Rings

Reducing the Height of Independent Spanning Trees in Chordal Rings
Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, and Yue-Li Wang
IEEE Transactions on Parallel and Distributed Systems, Vol. 18, No. 5, (2007) pp. 644-657.

The above article has been cited by the articles listed below.
  1. Jinn-Shyong Yang, Shyue-Ming Tang, Jou-Ming Chang, Yue-Li Wang, Parallel construction of optimal independent spanning trees on hypercubes, Parallel Computing 33 (2007) 73-79.

  2. Sun-Yuan Hsieh, Chang-Jen Tu, Constructing edge-disjoint spanning trees in locally twisted cubes, Theoretical Computer Science 410 (2009) 926-932.

  3. Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang, On the independent spanning trees of recursive circulant graphs G(cd^m, d) with d > 2, Theoretical Computer Science 410 (2009) 2001-2010. (*)

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

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

  6. Yi-Jiun Liu, Well Y. Chou, James K. Lan, Chiuyuan Chen, Constructing independent spanning trees for hypercubes and locally twisted cubes, Proceedings of the 10th International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN 2009), Kaoshiung, Taiwan, Dec. 14-16, 2009, pp. 17-22. (*)

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

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

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

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

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

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

  13. Yi-Jiun Liu, James K. Lan, Well Y. Chou, Chiuyuan Chen, Constructing independent spanning trees for locally twisted cubes, Theoretical Computer Science 412 (2011) 2237-2252. (*)

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

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

  16. R. Seethalakshml, K. S. Ravichandran, Reliability analysis of ring, agent and cluster based distributed systems, Journal of Theoretical and Applied Information Technology 30 (2011) 42-47.

  17. Yan Wang, Jianxi Fan, Yuejuan Han, Construction of independent spanning trees on twisted-cubes, Proceedings of 2011 IEEE International Conference on Computer Science and Automation Engineering (CSAE), Shanghai, China, 10-12 June 2011, pp. 250-254.

  18. Yan Wang, Jianxi Fan, Yuejuan Han, An algorithm to find optimal independent spanning trees on twisted-cubes, Proceedings of 2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP), Suzhou, China, 9-11 Dec. 2011, pp. 52-56.

  19. Jeeraporn Werapun, Sarun Intakosum, Veera Boonjing, An efficient parallel construction of optimal independent spanning trees on hypercubes, Journal of Parallel and Distributed Computing 72 (2012) 1713-1724. (*)

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

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

  22. Yan-Hong Zhang, Wei Hao, Tao Xiang, Independent spanning trees in crossed cubes, Information Processing Letters 113 (2013) 653-658. (*)

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

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

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

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

  27. Kung-Jui Pai, Jinn-Shyong Yang, Sing-Chen Yao, Shyue-Ming Tang, Jou-Ming Chang, Completely independent spanning trees on some interconnection networks, IEICE Transactions on Information and Systems E97-D (2014). (*)

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

  29. 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 Supercomputing 71 (2015) 894-908. (*)

  30. Dexiang Wang, Bandwidth-efficiency-oriented topology optimization for integrated switching systems based on circulant graphs, Computer Networks 83 (2015) 199-216. (*)

  31. Jinn-Shyong Yang, Jou-Ming Chang, Kung-Jui Pai, Hung-Chang Chan, Parallel construction of independent spanning trees on enhanced hypercubes, IEEE Transactions on Parallel and Distributed Systems 26 (2015) 3090-3098. (*)

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

  33. Kriti Kaushik, G. L. Pahuja, Disjointing technique for reliability evaluation of computer communication networks, Proceedings of the 4th International Conference on Eco-friendly Computing and Communication Systems (ICECCS), Kurushetra, India, 7-8 Dec. 2015, pp. 205-211. (*)

  34. Yukihiro Hamada, Independent spanning trees of 2-chordal rings, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E99-A (2016) 355-362. (*)

  35. Kung-JuiPai, Jou-Ming Chang, Constructing two completely independent spanning trees in hypercube-variant networks, Theoretical Computer Science 652 (2016) 28-37. (*)

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

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

  38. Jou-Ming Chang, Hung-Yi Chang, Hung-Lung Wang, Kung-Jui Pai, Jinn-Shyong Yang, Completely independent spanning trees on 4-regular chordal rings, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E100-A (2017) 1932-1935. (*)

  39. Baolei Cheng, Jianxi Fan, Qiang Lyu, Jingya Zhou, Zhao Liu, Constructing independent spanning trees with height n on the n-dimensional crossed cube, Future Generation Computer Systems 87 (2018) 404-415. (*)

  40. Smruti A. Mane, Smita A. Kandekar, Balu N. Waphare, Constructing spanning trees in augmented cubes, Journal of Parallel and Distributed Computing 122 (2018) 188-194. (*)

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

  42. Shu-Li Zhao, Rong-Xia Hao, Jie Wu, The generalized 3-connectivity of some regular networks, Journal of Parallel and Distributed Computing 133 (2019) 18-29. (*)

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

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

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

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

  47. Ningning Liu, Yujie Zhang, Weibei Fan Construction of completely independent spanning tree based on vertex degree, Proceedings of International Conference on Parallel and Distributed Computing: Applications and Technologies (IPDCAT 2020), Shenzhen, China, Dec. 28-30, 2020, Lecture Notes in Computer Science, Vol 12606. Springer, Cham. pp. 94-103

  48. Xiao-Wen Qin, Rong-Xia Hao, Jie Wu Construction of dual-CISTs on an infinite class of networks, IEEE Transactions on Parallel and Distributed Systems 33(8) (2022) 1902-1910. (*)

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

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

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

  52. Huanwen Zhang, Yan Wang, Jianxi Fan, Chang Shu, Edge-independent spanning trees in folded crossed cubes, Theoretical Computer Science 970 (2023) 114053. (*)

Times cited: 43 (from Web of Science)