|The Langberg-Medard Multiple Unicast Conjecture: Stable 3-Pair Networks
|Kai Cai, Guangyue Han, The University of Hong Kong, China
|N.1: Network Coding I
|Networking and Network Coding
|Click here to download the manuscript
|Click here to watch in the Virtual Symposium
|The Langberg-Medard multiple unicast conjecture claims that for a strongly reachable k-pair network, there exists a multi-flow with rate (1,1,...,1). In this paper, we show that the conjecture holds true for stable 3-pair networks.