Maximum flow in parallel networks with connected arcs

The well-known problem of finding maximum flows in classical networks has many solution algorithms that have a polynomial computational complexity depending on the size of the network. In general, the problem of finding maximum flows for networks with connected arcs is NP-complete. However, among the previously studied networks with connected arcs, there are networks for which the calculation of maximum flows is feasible in a time polynomially depending on the size of the network. This work is devoted to determining the influence of the topology of networks with connected arcs on the possibility of finding maximum flows in polynomial time. In this paper, for a class of parallel networks with connected arcs, we propose a fast polynomial algorithm for finding maximum flows.