DETERMINATION OF MAXIMUM FLOW IN DECENTRALIZED NETWORKS

Authors

  • Serhiy Yukhymchuk Vinnytsia National Technical University
  • Dmytro Bilous Vinnytsia National Technical University

Abstract

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.

Author Biographies

Serhiy Yukhymchuk, Vinnytsia National Technical University

Head of the Department

Dmytro Bilous, Vinnytsia National Technical University

Master student of the Department

Downloads

Abstract views: 138

How to Cite

[1]
S. Yukhymchuk and D. Bilous, “DETERMINATION OF MAXIMUM FLOW IN DECENTRALIZED NETWORKS”, Works of VNTU, no. 1, Dec. 2011.

Issue

No. 1 (2007): 2007№1

Section

Automatics and Information Measuring Facilities

Metrics

Downloads

Download data is not yet available.