DETERMINATION OF MAXIMUM FLOW IN DECENTRALIZED NETWORKS

Анотація

The paper presents the methods and algorithms for determination of maximum flow in decentralized networks, based on the Goldberg – Raо iterative algorithm. There had been given the main assumptions and requirements to the bringing of the maximum flow search task in the decentralized net to the task in the oriented net with the unique source and outflow. To determine the maximum flow there had been suggested the iterated algorithm with the application of binary functions.