Packing internally disjoint Steiner paths of data center networks

Wen-Han Zhu, Rong-Xia Hao, Jou-Ming Chang +1

Let $S\subseteq V(G)$ and ${\pi }_G(S)$ denote the maximum number $t$ of edge-disjoint paths $P_1,P_2,\dots ,P_t$ in a graph $G$ such that $V(P_i)\cap V(P_j)=S$ for any $i,j…