Possibly Related Publications

The following publications are possibly variants of this publication:

• Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center NetworksYifeng Wang, Baolei Cheng, Yu Qian, Dajin Wang. TC, 71(5):1194-1203, 2022. [doi]
• Constructing completely independent spanning trees in crossed cubesBaolei Cheng, Dajin Wang, Jianxi Fan. DAM, 219:100-109, 2017. [doi]
• Constructing Node-Independent Spanning Trees in Augmented CubesBaolei Cheng, Jianxi Fan, Qiang Lyu, Cheng-Kuan Lin, Xiaoyan Li, Guo Chen. FUIN, 176(2):103-128, 2020. [doi]
• An improved algorithm to construct edge-independent spanning trees in augmented cubesBaolei Cheng, Jianxi Fan, Cheng-Kuan Lin, Yan Wang, Guijuan Wang. DAM, 277:55-70, 2020. [doi]
• Constructing independent spanning trees for locally twisted cubesYi-Jiun Liu, James K. Lan, Well Y. Chou, Chiuyuan Chen. TCS, 412(22):2237-2252, 2011. [doi]
• An algorithm to construct independent spanning trees on parity cubesYan Wang, Jianxi Fan, Xiaohua Jia, He Huang. TCS, 465:61-72, 2012. [doi]
• Edge-independent spanning trees in augmented cubesYan Wang, Hong Shen, Jianxi Fan. TCS, 670:23-32, 2017. [doi]