Constructing Two Completely Independent Spanning Trees in Hypercube-variant Networks
Kung-Jui Pai and Jou-Ming Chang
Theoretical Computer Science, Vol. 652, (2016) pp. 28-37.

The above article has been cited by the articles listed below.
  1. 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. (*)

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

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

  4. Toru Hasunuma, Augmenting a tree to a k-arbor-connected graph with pagenumber k, 34th European Workshop on Computational Geometry (EuroCG 2018), Berlin, Germany, March 21-23, 2018, pp. 27:1-27:6.

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

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

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

  9. Kung-Jui Pai, Designing an algorithm to improve the diameters of completely independent spanning trees in crossed cubes, In: Chang CY., Lin CC., Lin HH. (eds) New Trends in Computer Technologies and Applications, Proceedings of International Computer Symposium (ICS 2018), Communications in Computer and Information Science, vol 1013. Springer, pp. 433-439

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

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

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

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

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

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

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

  17. Guo Chen, Baolei Cheng, Dajin Wang, Constructing completely independent spanning trees in data center network based on augmented cube, IEEE Transaction on Parallel and Distributed systems 32 (2021) 665-673. (*)

  18. Xiao-Wen Qin, Rong-Xia Hao, Reliability analysis based on the dual-CIST in shuffle-cubes, Applied Mathematics and Computation 397 (2021) 125900. (*)

  19. Yujie Zhang, Weibei Fan, Zhijie Han, Yunfei Song, Ruchuan Wang, Fault-tolerant routing algorithm based on disjoint paths in 3-ary n-cube networks with structure faults, The Journal of Supercomputing 77(11) (2021) 13090-13114. (*)

  20. Toru Hasunuma, Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k, Proceedings of the 32nd International Workshop on Combinatorial Algorithms (IWOCA 2021), July 5-7, Ottawa, ON Canada, LNCS 12757, pp. 356-369, 2021. (*)

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

  22. Yu-Han Chen, Kung-Jui Pai, Hsin-Jung Lin, Jou-Ming Chang, Constructing tri-CISTs in shuffle-cubes, 27th International Computing and Combinatorics Conference (COCOON 2021), Tainan, Taiwan, Oct. 24-26, 2021, Lecture Notes in Computer Science, vol 13025, pp. 330-342. (*)

  23. Qingrong Bian, Baolei Cheng, Jianxi Fan, Zhiyong Pan, Completely independent spanning trees in the line graphs of torus networks, 21st International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP 2021), Virtual Event, Dec. 3-5, 2021, Lecture Notes in Computer Science, vol 13157, pp. 540-553. (*)

  24. Kung-Jui Pai, Ro-Yu Wu, Sheng-Lung Peng, Jou-Ming Chang, Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting, Proceedings of 23rd IEEE International Conference on High Performance Computing and Communications (HPCC 2021), Haikou, Hainan, China, Dec. 20-22, 2021, pp. 377-383.

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

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

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

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

  29. Yifeng Wang, Baolei Cheng, Jianxi Fan, Yu Qian, Ruofan Jiang, An algorithm to construct completely independent spanning trees in line graphs, The Computer Journal 65(12) (2022) 2979-2990. (*)

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

  31. Pranava K. Jha, Vertex transitivity, distance metric, and hierarchical structure of the dual-cube, Journal of Supercomputing 78(16) (2022) 17758-17775. (*)

  32. Kung-Jui Pai, Ro-Yu Wu, Sheng-Lung Peng, Jou-Ming Chang, Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting, The Journal of Supercomputing 79(4) (2023) 4126-4145. (*)

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

  34. Kung-Jui Pai, Dual protection routing trees on graphs, Mathematics 11(14) (2023) 3255. (*)

  35. Hsin-Jung Lin, Shyue-Ming Tang, Kung-Jui Pai, Jou-Ming Chang, A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks, International Journal of Foundations of Computer Science 35(5) (2024) 535-550. (*)

  36. Hui Dong, Huaqun Wang, Mengjie Lv, Weibei Fan, Reliable communication scheme based on completely independent spanning trees in data center networks, IEEE Transactions on Computers.

Times cited: 31 (from Web of Science)