Вестник Донского государственного технического университета (Aug 2018)
On the flow peculiarity in network with barrier reachability
Abstract
The problem of finding maximal flow in networks with barrier reachability is considered. It is shown that existing algorithm for solution this problem can't find solution for all networks. New algorithm is suggested.