The Max-Flow Problem Statement on the Three-Pole Open Network Graph

In this paper, the max-flow problem (MFP) discussed in terms of feasible product flow through a network graph. Three types of max-flow tasks considered on two-polar, bipartite and multi-polar graphs (MF2, MFB and MFM). Known approaches and algorithms for two types of max-flow problem solution observed (MF2 and MFB). Particular properties of the modern telecommunication networks have been analyzed in the context of MFM study. An extended class of freely-oriented network graph determined with respect to the MFM modeling. Generalized max flow task statement introduced on an open three-pole freely-oriented graph behind the software defined network architecture.