The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Extreme Min – Cut Max – Flow Algorithm
|
|
Author(s): 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)and Santosh Kumar (RMIT University, Australia)
Copyright: 2023
Volume: 14
Issue: 1
Pages: 16
Source title:
International Journal of Applied Metaheuristic Computing (IJAMC)
Editor(s)-in-Chief: Peng-Yeng Yin (Ming Chuan University, Taiwan)
DOI: 10.4018/IJAMC.322436
Purchase
|
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.
Related Content
|
Abid Sabrina, Debbat Fatima.
© 2024.
20 pages.
|
|
Maryam AlJame, Aisha Alnoori, Mohammad G. Alfailakawi, Imtiaz Ahmad.
© 2023.
27 pages.
|
|
Trust Tawanda, Philimon Nyamugure, Elias Munapo, Santosh Kumar.
© 2023.
16 pages.
|
|
Sarab Almuhaideb, Najwa Altwaijry, Shahad AlMansour, Ashwaq AlMklafi, AlBandery Khalid AlMojel, Bushra AlQahtani, Moshail AlHarran.
© 2022.
22 pages.
|
|
Preeti Pragyan Mohanty, Subrat Kumar Nayak.
© 2022.
32 pages.
|
|
Sajad Ahmad Rather, P. Shanthi Bala.
© 2022.
39 pages.
|
|
Ines Sbai, Saoussen Krichen.
© 2022.
34 pages.
|
|
|