IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v14y2023i1p1-16.html
   My bibliography  Save this article

Extreme Min – Cut Max – Flow Algorithm

Author

Listed:
  • Trust Tawanda

    (National University of Science and Technology, Zimbabwe)

  • Philimon Nyamugure

    (National University of Science and Technology, Zimbabwe)

  • Elias Munapo

    (North West University, South Africa)

  • Santosh Kumar

    (RMIT University, Australia)

Abstract

In this article, the authors propose a maximum flow algorithm based on flow matrix. The algorithm only requires the effort to reduce the capacity of the underutilized arcs to that of the respective flow. The optimality of the algorithm is proved by the max-flow min-cut theorem. The algorithm is table-based, thus avoiding augmenting path and residual network concepts. The authors used numerical examples and computational comparisons to demonstrate the efficiency of the algorithm. These examples and comparisons revealed that the proposed algorithm is capable of computing exact solutions while using few iterations as compared to some existing algorithms.

Suggested Citation

  • Trust Tawanda & Philimon Nyamugure & Elias Munapo & Santosh Kumar, 2023. "Extreme Min – Cut Max – Flow Algorithm," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 14(1), pages 1-16, January.
    • Handle: RePEc:igg:jamc00:v:14:y:2023:i:1:p:1-16
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.322436
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jamc00:v:14:y:2023:i:1:p:1-16. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.