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

Akhmediyarova Ainur; Kassymova Dinara; Utegenova Anar; Utepbergenov Irbulat

doi:10.1515/comp-2016-0017

Open Computer Science (Dec 2016)

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

Akhmediyarova Ainur,
Kassymova Dinara,
Utegenova Anar,
Utepbergenov Irbulat

Affiliations

Akhmediyarova Ainur: Institute of Information and Computing Technologies, Almaty, Kazakhstan
Kassymova Dinara: Institute of Information and Computing Technologies, Almaty, Kazakhstan
Utegenova Anar: Institute of Information and Computing Technologies, Almaty, Kazakhstan
Utepbergenov Irbulat: Institute of Information and Computing Technologies, Almaty, Kazakhstan

DOI: https://doi.org/10.1515/comp-2016-0017
Journal volume & issue: Vol. 6, no. 1
pp. 213 – 218

Abstract

Read online

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.

Published in Open Computer Science

ISSN: 2299-1093 (Online)
Publisher: De Gruyter
Country of publisher: Poland
LCC subjects: Science: Mathematics: Instruments and machines: Electronic computers. Computer science
Website: https://www.degruyter.com/view/j/comp

About the journal

Abstract

Keywords