On M-route flows in a network

In a flow network an m-F-ring, which corresponds to an m-route channel in a communication network, is defined. An m-route flow between two vertices is the sum of m-F-rings between them, and its value is defined to be the sum of values of those m-F-rings. The m-route capacity of a cut is also defined. The authors show that the maximum value of m-route flows is equal to the minimum value of m-route capacities of the cuts separating those vertices. A method for obtaining this maximum value is presented.<
>