Flows in Multiple Networks
The article is devoted to the problem of finding maximum flow in a multiple network. NP-completeness of this problem is proved for networks of any multiplicity к ≥ 2. Also, the networks of a special form (divisible networks) are explored. The algorithm of finding the maximum multiple flow in the divisible network is offered.