The constructions of node-disjoint paths have been well applied to the study of connectivity, diameter, parallel routing, reliability, and fault tolerance of an interconnection network. In order to minimize the transmission cost and latency, the total length and maximal length of the node-disjoint paths should be minimized, respectively. The construction of node-disjoint paths with their maximal length minimized (in the worst case) has been studied previously in folded hypercubes. In this paper, we construct m node-disjoint paths from one source node to other m (not necessarily distinct) target nodes, respectively, in an n-dimensional folded hypercube so that both of their total length and maximal length (in the worst case) are minimized, where m$\le$n+1. In addition, each path is either shortest or nearly shortest. The construction of these node-disjoint paths can be efficiently carried out in O(${\mathit{mn}}^{\mathrm{1.5}}+{\mathit{m}}^{3}n$) and O(${\mathit{mn}}^2$+ ${\mathit{n}}^2$logn+${\mathit{m}}^3$n) time, respectively, for odd and even n by taking advantage of two specific routing functions, which provide another strong evidence for the effective applications of routing functions in deriving node-disjoint paths, especially for the variants of hypercubes.

节点不相交路径的构造已很好地应用于互连网络的连通性，直径，并行路由，可靠性和容错性的研究。为了最小化传输成本和等待时间，节点不相交路径的总长度和最大长度应分别最小化。先前已经在折叠超立方体中研究了最大长度最小化的节点不相交路径的构造（在最坏的情况下）。在本文中，我们在n维折叠超立方体中分别构造了从一个源节点到其他m个（不一定是不同的）目标节点的m个节点不相交的路径，以便它们的总长度和最大长度（在最坏的情况下） ）最小化，其中m$\le$n +1。另外，每个路径都是最短的或几乎最短的。这些节点不相交路径的构造可以在O（${\mathit{mn}}^{\mathrm{1.5}}+{\mathit{米}}^3ñ$）和O（${\mathit{mn}}^2$+ ${\mathit{ñ}}^2$登录n +${\mathit{米}}^3$通过利用两个特定的路由功能，分别为n和n个时间提供了时间，这为路由功能在推导节点不相交路径中的有效应用（尤其是超立方体的变体）提供了强有力的证据。