Maximum Network Flow Algorithms

Authors

  • Mohan Chandra Adhikari Central Department of Mathematics, IOST, Tribhuvan University, Kathmandu, Nepal
  • Umila Pyakurel 2Central Department of Mathematics, IOST, Tribhuvan University, Kathmandu, Nepal

DOI:

https://doi.org/10.3126/jacem.v6i0.38321

Keywords:

network flow, augmenting path algorithm, Maximum flow, push relabel algorithm

Abstract

The aim of the maximum network flow problem is to push as much flow as possible between two special vertices, the source and the sink satisfying the capacity constraints. For the solution of the maximum flow problem, there exists a number of algorithms. The existing algorithms can be divided into two families. First, augmenting path algorithms that satisfy the conservation constraints at intermediate vertices and the second preflow push relabel algorithms that violates the conservation constraints at the intermediate vertices resulting incoming flow more than outgoing flow.In this paper, we study different algorithms that determine the maximum flow in the static and dynamic networks.

Downloads

Download data is not yet available.
Abstract
144
PDF
135

Downloads

Published

2021-07-08

How to Cite

Adhikari, M. C., & Pyakurel, U. (2021). Maximum Network Flow Algorithms. Journal of Advanced College of Engineering and Management, 6, 75–81. https://doi.org/10.3126/jacem.v6i0.38321

Issue

Section

Articles