Completely Independent Spanning Trees on Some Interconnection Networks
Kung-Jui Pai, Jinn-Shyong Yang, Sing-Chen Yao, Shyue-Ming Tang, and Jou-Ming Chang
IEICE Transactions on Information and Systems, Vol. E97-D, No. 2 (2014) pp. 2514-2517.

The above article has been cited by the articles listed below.
  1. Hung-Yi Chang, Hung-Lung Wang, Jinn-Shyong Yang, Jou-Ming Chang, A note on the degree condition of completely independent spanning trees, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E98-A (2015) 2191-2193. (*)

  2. Baolei Cheng, Jianxi Fan, Dajin Wang, Jiwen Yang, A reliable broadcasting algorithm in locally twisted cubes, Proceedings of the 2nd IEEE International Conference on Cyber Security and Cloud Computing (CSCloud 2015), New York; United States, Nov. 3, 2015, pp. 323-328. (*)

  3. Toru Hasunuma, Minimum degree conditions and optimal graphs for completely independent sanning trees, Proceedings of the 26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Verona, Italy, Oct. 5-7, 2015, pp. 260-273

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

  5. Baolei Cheng, Dajin Wang, Jianxi Fan, Constructing completely independent spanning trees in crossed cubes, Discrete Applied Mathematics 219 (2017) 100-109.

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

  7. Benoit Darties, Nicolas Gastineau, Olivier Togni, Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees, Discrete Applied Mathematics 236 (2018) 124-136. (*)

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

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

  10. Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang, A two-stages tree-searching algorithm for finding three completely independent spanning trees, Theoretical Computer Science 784 (2019) 65-74. (*)

  11. Kung-Jui Pai, Jou-Ming Chang, Dual-CISTs: configuring a protection routing on some Cayley networks, IEEE/ACM Transactions on Networking 27 (2019) 1112-1123. (*)

  12. Xiao-Wen Qin, Jou-Ming Chang, Rong-Xia Hao, Constructing dual-CISTs of DCell data center networks, Applied Mathematics and Computation 362 (2019) 124546. (*)

  13. Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang, Three completely independent spanning trees of crossed cubes with application to secure-protection routing, Proceedings of 21st IEEE International Conference on High Performance Computing and Communications (HPCC 2019), Zhangjiajie, China, August 10-12, 2019, art. no. 8855608, pp. 1358-1365.

  14. Yi-Xian Yang, Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang, Constructing two completely independent spanning trees in balanced hypercubes, IEICE Transactions on Information and Systems E102-D (2019) 2409-2412. (*)

  15. Xiao-Wen Qin, Rong-Xia Hao, Jou-Ming Chang, The existence of completely independent spanning trees for some compound graphs, IEEE Transactions on Parallel and Distributed Systems 31 (2020) 201-210. (*)

  16. Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang, A well-equalized 3-CIST partition of alternating group graphs, Information Processing Letters 155 (2020) Article 105874. (*)

  17. Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang, A protection routing with secure mechanism in Mobius cubess, Journal of Parallel and Distributed Computing 140 (2020) 1-12. (*)

  18. Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang, Constructing dual-CISTs of pancake graphs and performance assessment of protection routing on some Cayley networks, The Journal of Supercomputing 77 (2021) 990-1014. (*)

  19. Kung-Jui Pai, Ruay-Shiung Chang, JRo-Yu Wu, ou-Ming Chang, Three completely independent spanning trees of crossed cubes with application to secure-protection routing, Information Sciences 541 (2020) 516-530. (*)

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

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

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

  23. Xiao-Yan Li, Wanling Lin, Ximeng Liu, Cheng-Kuan Lin, Kung-Jui Pai, Jou-Ming Chang, Completely independent spanning trees on BCCC data center networks with an application to fault-tolerant routing, IEEE Transactions on Parallel and Distributed Systems 33(8) (2022) 1939-1952. (*)

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

  25. Kung-Jui Pai, Jinn-Shyong Yang, Guan-Yu Chen, Jou-Ming Chang, Configuring protection routing via completely independent spanning trees in dense Gaussian on-chip networks, IEEE Transactions on Network Science and Engineering 9(2) (2022) 932-946. (*)

  26. Yu-Han Chen, Kung-Jui Pai, Hsin-Jung Lin, Jou-Ming Chang, Constructing tri-CISTs in shuffle-cubes, Journal of Combinatorial Optimization 44(5) (2022) 3194-3211. (*)

  27. Xiao-Yan Li, Wanling Lin, Wenzhong Guo, Jou-Ming Chang, A secure data transmission scheme based on multi-protection routing in datacenter networks, Journal of Parallel and Distributed Computing 167 (2022) 222-231. (*)

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

  29. Xia Hong, Feng Gao, Zengbao Wu, Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete t-partite graph, Contributions to Discrete Mathematics 19(2) (2024) 23-35. (*)

Times cited: 24 (from Web of Science)