IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i15p1716-d598525.html
   My bibliography  Save this article

Adaptation of Random Binomial Graphs for Testing Network Flow Problems Algorithms

Author

Listed:
  • Adrian Marius Deaconu

    (Department of Mathematics and Computer Science, Faculty of Mathematics and Computer Science, Transilvania University of Brasov, 50003 Brașov, Romania)

  • Delia Spridon

    (Department of Mathematics and Computer Science, Faculty of Mathematics and Computer Science, Transilvania University of Brasov, 50003 Brașov, Romania)

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.

Suggested Citation

  • Adrian Marius Deaconu & Delia Spridon, 2021. "Adaptation of Random Binomial Graphs for Testing Network Flow Problems Algorithms," Mathematics, MDPI, vol. 9(15), pages 1-14, July.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:15:p:1716-:d:598525
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/15/1716/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/15/1716/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:15:p:1716-:d:598525. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.