Adaptation of Random Binomial Graphs for Testing Network Flow Problems Algorithms

• Main Authors: Adrian Marius Deaconu, Delia Spridon
• Format: Article
• Language: English
• Published: MDPI AG 2021-07-01
• Series: Mathematics
• Subjects: network flow; random networks; parallel programming; time efficiency of algorithms
• Online Access: https://www.mdpi.com/2227-7390/9/15/1716

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.