A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks

The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information over wireless communication networks. The max-flow/min-cut theorem of Ford and Fulkerson has recently been extended to this wireless relay model. This result was first proved by a random coding scheme over large blocks of transmitted signals. We demonstrate the same result with a deterministic, polynomial-time algorithm which takes as input a single transmitted signal instead of a long block of signals. The max-flow/min-cut theorem of Ford and Fulkerson is related to a number of famous results in combinatorics including Hall's marriage theorem. Hall's marriage theorem is a special case of a well-known result in matroid theory and in transversal theory named the Rado-Hall theorem. We show that the max-flow/min-cut theorem for linear deterministic relay networks is connected to (1) a two-dimensional tran...

• Type: Conference
• Year: 2010
• Where: SODA
• Authors: S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
• Keywords: Discrete Algorithms, Hall's Marriage Theorem, Max-flow/min-cut Theorem, SODA 2010, Two-dimensional Transversal Theorem