An Efficient Algorithm for Hamiltonian Path Embedding of k-Ary n-Cubes under the Partitioned Edge Fault Mode
Hongbin Zhuang, Xiao-Yan Li, Jou-Ming Chang, Dajin Wang
IEEE Transactions on Parallel and Distributed Systems, Vol. 34, No. 6, (2023) pp. 1802-1815.

The above article has been cited by the articles listed below.
  1. Yali Lv, Cheng-Kuan Lin, Lantao You, A novel conditional connectivity and Hamiltonian connectivity of BCube with various faulty elements, Mathematics 11(15) (2023) 3404. (*)

  2. Hongbin Zhuang, Wanling Lin, Xiao-Yan Li, Jou-Ming Chang, Matroidal connectivity and conditional matroidal connectivity of star graphs, Theoretical Computer Science 977 (2023) 114173. (*)

  3. Yihong Wang, Hai Liu, Jia Yu, Yan Wang, Baolei Cheng, Jianxi Fan, Fault-tolerant unicast paths constructive algorithms in a family of recursive networks, Journal of the Chinese Institute of Engineers 47(3) (2024) 265-272. (*)

  4. Hongbin Zhuang, Xiao-Yan Li, Jou-Ming Chang, Ximeng Liu, Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model, Journal of Parallel and Distributed Computing 190 (2024) 104887.

  5. Hongbin Zhuang, Xiao-Yan Li, Dajin Wang, Cheng-Kuan Lin, Kun Zhao, Enabling high fault-tolerant embedding capability of alternating group graphs, Future Generation Computer Systems.

Times cited: 3 (from Web of Science)