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

DOI10.1109/TIT.2011.2120250MaRDI QIDQ5280941zbMATH OpenFDO

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

(3)

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

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)