The Langberg-Médard Multiple Unicast Conjecture for 3-Pair Networks

DOI10.1109/TIT.2022.3154230zbMATH Open1505.94129OpenAlexW4214681728WikidataQ123257823 ScholiaQ123257823MaRDI QIDQ5088515FDOQ5088515

Authors: Kai Cai, Guangyue Han 

Publication date: 13 July 2022

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2022.3154230

zbMATH Keywords

feasible multi-flowLangberg-Médard multiple unicast conjecture

Mathematics Subject Classification ID

Flows in graphs (05C21) Applications of graph theory to circuits and networks (94C15)

Cited In (1)

• An optimization approach to the Langberg-Médard multiple unicast conjecture

This page was built for publication: The Langberg-Médard Multiple Unicast Conjecture for 3-Pair Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088515)