论文标题
Langberg-Médard多个单次猜想：稳定$ 3 $ pair Networks
The Langberg-Médard Multiple Unicast Conjecture: Stable $3$-Pair Networks
论文作者
论文摘要
Langberg-Médard多个Unicast猜想声称，对于强大的$ k $ pair网络，存在一个带有费率$ $（1,1，\ dots，1）$的多流量。在本文中，我们表明猜想对于{\ em stable} $ 3 $ pair Networks是正确的。
The Langberg-Médard multiple unicast conjecture claims that for a strongly reachable $k$-pair network, there exists a multi-flow with rate $(1,1,\dots,1)$. In this paper, we show that the conjecture holds true for {\em stable} $3$-pair networks.
