Skip to Content
You are currently on the new version of our website. Access the old version .
MathematicsMathematics
  • Feature Paper
  • Article
  • Open Access

21 July 2021

14 Pages

Adaptation of Random Binomial Graphs for Testing Network Flow Problems Algorithms

and
Department of Mathematics and Computer Science, Faculty of Mathematics and Computer Science, Transilvania University of Brasov, 50003 Brașov, Romania
*
Author to whom correspondence should be addressed.
This article belongs to the Section E: Applied Mathematics

Abstract

Algorithms for network flow problems, such as maximum flow, minimum cost flow, and multi-commodity flow problems, are continuously developed and improved, and so, random network generators become indispensable to simulate the functionality and to test the correctness and the execution speed of these algorithms. For this purpose, in this paper, the well-known Erdős–Rényi model is adapted to generate random flow (transportation) networks. The developed algorithm is fast and based on the natural property of the flow that can be decomposed into directed elementary s-t paths and cycles. So, the proposed algorithm can be used to quickly build a vast number of networks as well as large-scale networks especially designed for s-t flows.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.