The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks
Yi-Cheng Yang, Shih-Shun Koa, Ralf Klasing, Sun-Yuan Hsieh, Hsin-Hung Chou, and Jou-Ming Chang
IEEE Access, Vol. 9, (2021) 16679-16691.

The above article has been cited by the articles listed below.
  1. Jung-Hyun Seo, Hyeong-Ok Lee, Recursively divided pancake graphs with a small network cost, Symmetry 13(5) (2021) 844. (*)

  2. Jinn-Shyong Yang, Xiao-Yan Li, Sheng-Lung Peng, Jou-Ming Chang, Parallel construction of multiple independent spanning trees on highly scalable datacenter network, Applied Mathematics and Computation 413 (2022) 126617. (*)

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

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

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

  6. Jiafei Liu, Shuming Zhou, Hong Zhang, Gaolin Chen, Vulnerability analysis of multiprocessor system based on burnt pancake networks, Discrete Applied Mathematics 314 (2022) 304-320. (*)

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

  8. Zhiyong Pan, Baolei Cheng, Jianxi Fan, Yan Wang, Xiajing Li, A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks, Theoretical Computer Science 942 (2023) 33-46. (*)

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

Times cited: 7 (from Web of Science)