Back to Search
Start Over
The Langberg-Médard Multiple Unicast Conjecture for 3-Pair Networks.
- Source :
- IEEE Transactions on Information Theory; Jun2022, Vol. 68 Issue 6, p3879-3895, 17p
- Publication Year :
- 2022
-
Abstract
- The Langberg-Médard multiple unicast conjecture claims that for a strongly reachable $k$ -pair network, there exists a feasible multi-flow with rate $(1,1, {\dots },1)$. In this paper, we confirm the conjecture for $k=3$. [ABSTRACT FROM AUTHOR]
- Subjects :
- LOGICAL prediction
LINEAR network coding
MULTICASTING (Computer networks)
Subjects
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 68
- Issue :
- 6
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 157007242
- Full Text :
- https://doi.org/10.1109/TIT.2022.3154230