A MAX-Flow/MIN-Cut algorithm for a class of wireless networks

MaRDI QIDQ5417701zbMATH OpenFDO

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

Publication date 22 May 2014

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18)

Recommendations

• Combinatiorial algorithms for wireless information flow
• scientific article; zbMATH DE number 7051224
• A flow model based on polylinking system
• Polynomial Time Algorithms for Multicast Network Code Construction

Cited in

(5)

• Max-flow min-cut theorems on dispersion and entropy measures for communication networks
• Randomized and deterministic algorithms for network coding problems in wireless networks
• Minimizing flow time in the wireless gathering problem
• Cost minimization in wireless networks with a bounded and unbounded number of interfaces
• A flow model based on polylinking system

This page was built for publication: A MAX-Flow/MIN-Cut algorithm for a class of wireless networks

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