A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks

DOI10.1109/TIT.2011.2120250zbMATH Open1366.94263MaRDI QIDQ5280941FDOQ5280941

Authors: S. M. Sadegh Tabatabaei Yazdi, S. A. Savari 

Publication date: 27 July 2017

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Coding theorems (Shannon theory) (94A24) Communication networks in operations research (90B18)

Cited In (4)

• Multicommodity flows and cuts in polymatroidal networks
• Multicasting in Linear Deterministic Relay Network by Matrix Completion
• (Secure) linear network coding multicast
• A bottleneck detection algorithm for complex product assembly line based on maximum operation capacity

This page was built for publication: A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks

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