Maximum Flow Problem
No Thumbnail Available
Date
2022-09
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Addis Ababa University
Abstract
In this thesis, We address about the Concept of Maximum flow Problem and the Solution Methods to Solve the Problem. In this Work the Generic Augmenting Path Algorithm and Ford-Fulkerson Labeling Method are Presented to find the Maximum flow in a Network flow Problem.
Description
Keywords
Network Flows, Maximum Flow Problems, Max-Flow Min-Cut Theorem, Generic Augmenting Path Algorithm, Ford Fulkerson Labeling Method