Constructing Dual-CISTs of Pancake Graphs and Performance Assessment of Protection Routing on Some Cayley Networks
Kung-Jui Pai, Ruay-Shiung Chang, and Jou-Ming Chang
The Journal of Supercomputing, Vol. 77, No. 1, (2021) 990-1014.

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

  2. Jung-Hyun Seo, Hyeong-Ok Lee, Recursively divided pancake graphs with a small network cost, Symmetry 13(5) (2021) 844. (*)

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

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

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

  6. Jung-Hyun Seo, Hyeong-Ok Lee, Recursively divided pancake graphs with a small network cost, Symmetry 13(5) (2021) 844.

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

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

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

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

  11. Kun Zhao, Hongbin Zhuang, Xiao-Yan Li, Fangying Song, Lichao Su, Partition-edge fault-tolerant Hamiltonicity of pancake graphs, 25th International Computer Symposium (ICS 2022), Taoyuan, Taiwan, Dec. 15-17, 2022, Communications in Computer and Information Science, vol 1723, pp. 192-204.

  12. Mei-Mei Gu, Jou-Ming Chang, Neighbor connectivity of pancake graphs and burnt pancake graphs, Discrete Applied Mathematics 324 (2023) 46-57. (*)

  13. Toru Hasunuma, Completely Independent Spanning Trees in Line Graphs, arXiv:2209.09565 [math.CO]

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

  15. Toru Hasunuma, Completely independent spanning trees in line graphs, Graphs and Combinatorics 39(5) (2023) 90. (*)

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

  17. Caio Henrique Segawa Tonetti, Vinicius Fernandes dos Santos, Sebastian Urrutia, Polynomial time algorithms for the token swapping problem on cographs, RAIRO - Operations Research 58(1) (2024) 441-455. (*)

Times cited: 11 (from Web of Science)