Given disjoint source and sink sets, $S=\{s_1,\dots ,s_k\}$ and $T=\{t_1,\dots ,t_k\}$, in a graph G, an unpaired k-disjoint path cover joining S and T is a set of pairwise vertex-disjoint paths $\{P_1,\dots ,P_k\}$ that altogether cover every vertex of the graph, in which $P_i$ is a path from source $s_i$ to some sink $t_j$. In terms of a generalized scattering number, named an r-scattering number, we characterize interval graphs that have an unpaired 2-disjoint path cover joining S and T for any possible configurations of source and sink sets S and T of size 2 each. Also, it is shown that the r-scattering number of an interval graph can be computed in polynomial time.

给定不相交的源和接收器集， $\mathrm{小号}=\{s_{\mathrm{1个}}，\dots ，s_{ķ}\}$ 和 $Ť=\{{Ť}_{\mathrm{1个}}，\dots ，{Ť}_{ķ}\}$在图G中，连接S和T的不成对的k不相交路径覆盖是成对的顶点不相交路径的集合$\{P_{\mathrm{1个}}，\dots ，P_{ķ}\}$ 总共覆盖了图的每个顶点，其中 $P_{\mathrm{一世}}$ 是源头之路 $s_{\mathrm{一世}}$ 到一些水槽 ${Ť}_{Ĵ}$。在广义散射数量，名为方面R-散射数量，我们表征具有不成对2不相交的路径盖接合间隔的曲线图小号和Ť源和宿套任何可能的配置小号和Ť大小2各自的。而且，示出了可以以多项式时间来计算间隔图的r-散射数。