Cut sets and information flow in networks of two-way channels
Gerhard G. Kramer, Serap A. Savari · 2004
A network of two way channels (TWCs) is specified by a graph having an edge between vertex u and vertex v if there is a TWC between these vertices. A new cut-set bound is determined for such networks when network coding is permitted, and some implications of this bound are discussed.