Publications
Article · Open Computer Science · January 1, 2016
Development and research of the algorithm for determining the maximum flow at distribution in the network
Ainur Аkhmediyarova, Dinara Kassymova, Анар Утегенова, Утепбергенов Ирбулат Туремуратович
Abstract
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.
Complexity and Algorithms in GraphsGraph Theory and AlgorithmsNetwork Traffic and Congestion Controlmaximum flowFord-Fulkerson algorithmflow distribution
More by Ainur Akhmediyarova
- A Knowledge-Augmented Multi-Agent AI System for Context-Aware Legal Reasoning and Case Outcome PredictionPreprints.org · 2026
- Building a Multilingual AI Legal Assistant Using Retrieval-Augmented Generation: A Case Study on the Legal System of KazakhstanComputers · 2026
- Secure Federated Intrusion Detection for Resource-Constrained IoT Devices Using Lightweight Cryptography: A Hardware-Validated StudyFuture Internet · 2026 · Citations: 2
- Behavioural Biometrics and Session-Level Risk Monitoring for Insider Threat Detection in Enterprise NetworksElectronics · 2026