The following publications are possibly variants of this publication:
- An efficient algorithm to construct disjoint path covers of DCell networksXi Wang, Jianxi Fan, Xiaohua Jia, Cheng-Kuan Lin. TCS, 609:197-210, 2016. [doi]
- One-to-One Disjoint Path Covers on MeshManyi Du, Jianxi Fan, Yuejuan Han, Cheng-Kuan Lin. ica3pp 2015: 420-433 [doi]
- Vertex-disjoint paths in DCell networksXi Wang, Jianxi Fan, Cheng-Kuan Lin, Xiaohua Jia. jpdc, 96:38-44, 2016. [doi]
- One-to-one disjoint path covers on alternating group graphsLantao You, Jianxi Fan, Yuejuan Han, Xiaohua Jia. TCS, 562:146-164, 2015. [doi]
- One-to-one disjoint path covers on multi-dimensional toriJing Li, Di Liu, Yuxing Yang, Jun Yuan. ijcm, 92(6):1114-1123, 2015. [doi]
- Toward the One-to-Two Balanced Disjoint-Path Cover of Matching Composition NetworksTzu-Liang Kung, Hon-Chan Chen, Lih-Hsing Hsu, Chi-Lun Wang. intcompsymp 2015: 67-76 [doi]
- A Node-to-Set Disjoint Path Routing Algorithm in DCell NetworksXi Wang, Jianxi Fan. cbd 2014: 196-200 [doi]