Configuring Protection Routing via Completely Independent Spanning Trees in Dense Gaussian On-Chip Networks
Kung-Jui Pai, Jinn-Shyong Yang, Guan-Yu Chen, Jou-Ming Chang
IEEE Transactions on Network Science and Engineering, Vol. 9, No. 2, (2022) 932-946.

The above article has been cited by the articles listed below.
  1. E. A. Monakhova, O. G. Monakhov, Effective algorithm for finding shortest paths in dense Gaussian networks, Prikladnaya Diskretnaya Matematika, no. 58 (2022) 94-104. (*)

  2. Emilia A. Monakhova, Oleg G. Monakhov, Aleksandr Y. Romanov, Routing algorithms in optimal degree four circulant networks based on relative addressing: comparative analysis for networks on chip, IEEE Transactions on Network Science and Engineering 10(1) (2023) 413-425. (*)

  3. Emilia A. Monakhova, Oleg G. Monakhov, E. Lezhnev, Aleksandr Y. Romanov, Optimal Routing Algorithm in Dense Gaussian Networks-on-Chip, 2022 International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME), 16-18 Nov. 2022, Maldives, Maldives.

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

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

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

  7. Andrei M. Sukhov, Aleksandr Y. Romanov, Maksim P. Selin, Virtual coordinate system based on a circulant topology for routing in networks-on-chip, Symmetry 16(1) (2024) 127. (*)

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

  9. Zaid Hussain, Fawaz AlAzemi, Bader AlBdaiwi, Completely independent spanning trees in Eisenstein-Jacobi networks, The Journal of Supercomputing 80(11) (2024) 15105-15121. (*)

  10. E. A. Monakhova, O. G. Monakhov, Database analysis of optimal double-loop networks, Prikladnaya Diskretnaya Matematika, 64 (2024) 56-71. (*)

  11. Shuai Liu, Yan Wang, Jianxi Fan, and Baolei Cheng, Edge-disjoint Hamiltonian cycles in balanced hypercubes with applications to fault-tolerant data broadcasting, International Journal of Foundations of Computer Science 36(1) (2025) 1-24. (*)

  12. E. A. Monakhova, O. G. Monakhov, E. R. Rzaev, A. A. Amerikanov, M. Y. Romashikhin, A. Y. Romanov, A new approach for automatic search for families of optimal undirected double-loop network, IEEE Access, 13 (2025) 104716-104722. (*)

  13. Hongyuan Yang, Rongzhou Duan, Jun Lin, Xunqian Tong, Zhu Han, Fan Zheng, Huaizhu Zhang, Linhang Zhang, Xintong Dong, A structure-free data aggregation method for distributed seismic nodes in deep earth exploration, IEEE Internet of Things Journal, 12(24) (2025) 53758-53774. (*)

  14. Maoqun Wang, Ruhua Liu, A note on the 4-connected line graph of a planar triangulation containing two CISTs, Graphs and Combinatorics, 42 (2026) Article: 5. (*)

  15. Jiakang Ma, Baolei Cheng, Yan Wang, Jianxi Fan, Junkai Zhu, Vertex-independent spanning trees in data center network BCDC, Computer Networks 276 (2026) 111981.

Times cited: 13 (from Web of Science)