Next Article in Journal
Strategy of Multi-Beam Spot Allocation for GEO Data Relay Satellite Based on Modified K-Means Algorithm
Previous Article in Journal
Evaluating the Application of CSR in the High-Tech Industry during the COVID-19 Pandemic
Article

Adaptation of Random Binomial Graphs for Testing Network Flow Problems Algorithms

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.
Academic Editor: Miklós Krész
Mathematics 2021, 9(15), 1716; https://doi.org/10.3390/math9151716
Received: 29 June 2021 / Revised: 16 July 2021 / Accepted: 20 July 2021 / Published: 21 July 2021
(This article belongs to the Special Issue Graph Theoretic Concepts in Data Science)
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. View Full-Text
Keywords: network flow; random networks; parallel programming; time efficiency of algorithms network flow; random networks; parallel programming; time efficiency of algorithms
Show Figures

Figure 1

MDPI and ACS Style

Deaconu, A.M.; Spridon, D. Adaptation of Random Binomial Graphs for Testing Network Flow Problems Algorithms. Mathematics 2021, 9, 1716. https://doi.org/10.3390/math9151716

AMA Style

Deaconu AM, Spridon D. Adaptation of Random Binomial Graphs for Testing Network Flow Problems Algorithms. Mathematics. 2021; 9(15):1716. https://doi.org/10.3390/math9151716

Chicago/Turabian Style

Deaconu, Adrian M., and Delia Spridon. 2021. "Adaptation of Random Binomial Graphs for Testing Network Flow Problems Algorithms" Mathematics 9, no. 15: 1716. https://doi.org/10.3390/math9151716

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop