Hypercubes are popular topologies of massive multiprocessor systems due to their super properties. Cross-cubes are significant variations of hypercubes and they have smaller diameters and higher fault-tolerant capability than hypercubes at the same dimensions. In this paper, we construct node-to-set disjoint paths of an n-dimensional cross-cube, \(C_{n}\), whose maximum length is limited by \(2n-3\). Furthermore, we propose an \(O(N \text {log}^{2}N)\) algorithm with a view to finding node-to-set disjoint paths of \(C_{n}\), where N is the node number of \(C_n\). And we also present the simulation results for the maximal length of disjoint paths obtained by our algorithm.

超立方体由于其超级特性而成为大规模多处理器系统的流行拓扑。交叉立方体是超立方体的重要变体，与相同维度的超立方体相比，它们具有更小的直径和更高的容错能力。在本文中，我们构造了一个n维交叉立方体\(C_{n}\) 的节点到集合不相交路径，其最大长度受\(2n-3\) 限制。此外，我们提出了一个\(O(N \text {log}^{2}N)\)算法，以寻找\(C_{n}\) 的节点到集合的不相交路径，其中N是\(C_n\) 的节点数. 并且我们还展示了由我们的算法获得的不相交路径的最大长度的模拟结果。