The above article has been cited by the articles listed below.
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.(*) Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang,
Constructing dual-CISTs of pancake graphs and performance assessment of protection routing on some Cayley networks ,
The Journal of Supercomputing 77 (2021) 990-1014.(*) Yu-Han Chen, Kung-Jui Pai, Hsin-Jung Lin, Jou-Ming Chang,
Constructing tri-CISTs in shuffle-cubes ,
27th International Computing and Combinatorics Conference (COCOON 2021), Tainan, Taiwan, Oct. 24-26, 2021, Lecture Notes in Computer Science, vol 13025, pp. 330-342.(*) 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.(*) 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.(*) Yifeng Wang, Baolei Cheng, Jianxi Fan, Yu Qian, Ruofan Jiang,
An algorithm to construct completely independent spanning trees in line graphs ,
The Computer Journal 65(12) (2022) 2979-2990.(*) 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.(*) Dongqin Cheng,
Two disjoint cycles of various lengths in alternating group graph ,
Applied Mathematics and Computation 433 (2022) 127407.(*) Baolei Cheng, Dajin Wang, Jianxi Fan,
Independent Spanning Trees in Networks - A Survey ,
ACM Computing Surveys 55(14) (2023) 335.(*)
Times cited: 9