Work

Development and research of the algorithm for determining the maximum flow at distribution in the network

Year: 2016

Type: article

Abstract: An upgraded version of Ford-Fulkerson algorithm is proposed, which allows to determine the maximum flow and the distribution flow in branches of the network. Results of simulation using this algorithm are given. They show its effectiveness in comparison with the other variants of flow distribution in the network at change of the capacity of branches randomly in time.

Source: Open Computer Science

DOI: 10.1515/comp-2016-0017

Authors: Ainur Akhmediyarova, Dinara Kassymova, Anar Utegenova, Irbulat Utepbergenov

Institution: Institute of Information and Computational Technologies

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

SDG: Industry, innovation and infrastructure

Open Access status: gold

Estimated APC paid: $1,187