On the capacity of multiple unicast sessions in undirected graphs

@article{Jain2005OnTC,
  title={On the capacity of multiple unicast sessions in undirected graphs},
  author={Kamal Jain and Vijay V. Vazirani and Gideon Yuval},
  journal={Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.},
  year={2005},
  pages={563-567}
}
Li and Li conjectured that in an undirected network with multiple unicast sessions, network coding does not lead to any coding gain. Surprisingly enough, this conjecture could not so far be verified even for the simple network consisting of K 3, 2 with four source-sink pairs. Using entropy calculus, we provide the first verification of the Li-Li conjecture for this network. We extend our bound to the case of an arbitrary directed bipartite network. 
Highly Cited
This paper has 36 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
26 Citations
0 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

Similar Papers

Loading similar papers…