Completely independent spanning trees on complete graphs, complete bipartite graphs and complete tripartite graphs
Kung-Jui Pai, Shyue-Ming Tang, Jou-Ming Chang, and Jinn-Shyong Yang,
Proceedings of the International Computer Symposium ICS 2012 (ICS 2012), Hualien, Taiwan, Dec. 107-113, 2012.
Advances in Intelligent Systems and Applications - Volume 1, Vol. 20, pp. 107-113.

This paper is cited by
  1. 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) pp. 2514-2517. (*)

  2. Benoit Darties, Nicolas Gastineau, Olivier Togni, Completely independent spanning trees in some regular graphs, arXiv:1409.6002v1 [cs.DM] 21 Sep 2014.

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

  4. Nicolas Gastineau, Benoit Darties, Olivier Togni, Recherche d'arbres couvrants completement independants dans des graphes reguliers, ALGOTEL 2014 - 16emes Rencontres Francophones sur les Aspects Algorithmiques des Telecommunications, Jun 2014, Le Bois-Plage-en-Re, France. (hal-00986223)

  5. Nicolas Gastineau, Benoit Darties, Olivier Togni, Arbres couvrants presque disjoints, ALGOTEL 2015 - 17emes Rencontres Francophones sur les Aspects Algorithmiques des Telecommunications, Jun 2015, Beaune, France. (hal-01148458)

  6. Alexandre Salles da Cunha, Fernanda Sumika Hojo de Souza, Finding totally independent spanning trees with linear integer programming, Proceedings of Third International Symposium on Combinatorial Optimization (ISCO 2014) Lisbon, Portugal, March 5-7, 2014, Lecture Notes in Computer Science Vol. 8596, pp. 149-160.

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

  8. Benoit Darties, Nicolas Gastineau, Olivier Togni, Completely independent spanning trees in some regular graphs, Discrete Applied Mathematics 217 (2017) 163-174. (*)

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

  10. Axel Moinet, Benoit Darties, Nicolas Gastineau, Jean-Luc Baril, Olivier Togni, Completely independent spanning trees for enhancing the robustness in ad-hoc networks, Proceedings of IEEE 13th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2017), Rome, Italy, Oct. 9-11, 2017, pp. 63-70

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

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

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

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

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

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

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

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

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

  20. Xia Hong, Huihui Zhang, A Hamilton sufficient condition for completely independent spanning tree, Discrete Applied Mathematics279 (2020) 183-187. (*)

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

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

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

  24. Yu Qian, Baolei Cheng, Jianxi Fan, Yifeng Wang, Ruofan Jiang, Edge-disjoint spanning trees in the line graph of hypercubes, Proceedings of 32nd International Conference on Application-specific Systems, Architectures and Processors (ASAP 2021), 7-9 Jul. 2021, NJ, USA, IEEE Xplore, pp. 61-64.

  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. Xiao-Yan Li, Wanling Lin, Jou-Ming Chang, Xiaohua Jia, Transmission failure analysis of multi-protection routing in data center networks with heterogeneous edge-core servers, IEEE/ACM Transactions on Networking 30(4) (2022) 1689-1702. (*)

  28. Yifeng Wang, Baolei Cheng, Yu Qian, Dajin Wang, Constructing completely independent spanning trees in a family of line-graph-based data center networks, IEEE Transactions on Computers 71(5) (2022) 1194-1203. (*)

  29. Jun Yuan, Ru Zhang, Aixia Liu, Degree conditions for completely independent spanning trees of bipartite graphs, Graphs and Combinatorics 38(6) (2022) 179. (*)

  30. Mengjie Lv, Jianxi Fan, Weibei Fan, Xiaohua Jia, A high-performantal and server-centric based data center network, IEEE Transactions on Network Science and Engineering 10(2) (2023) 592-605. (*)

  31. Wanling Lin, Xiao-Yan Li, Jou-Ming Chang, Xiaohua Jia, Constructing multiple CISTs on BCube-based data center networks in the occurrence of switch failures, IEEE Transactions on Computers 72(7) (2023) 1971-1984. (*)

  32. Baolei Cheng, Dajin Wang, Jianxi Fan, Independent spanning trees in networks - a survey, ACM Computing Surveys.

  33. Xia Hong, Wei Feng, Completely independent spanning trees in some Cartesian product graphs, AIMS Mathematics 8(7) (2023) 16127-16136. (*)

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

  35. Yongxin Guo, Qing Zhu, Yulin Ding, Yun Li, Haoyu Wu, Yang He, Zhihong Li, Hankan Li, Liguo Zhang, Yuanzhen Zhao, Yan Pan, Ting Yang, Mingwei Liu, Haowei Zeng, Efficient distributed association management method of data, model, and knowledge for digital twin railway, International Journal of Digital Earth 17(1) (2024) 2340089.

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