Maximum Flow Problem

Simple item page
dc.contributor.advisorBerhanu Guta (PhD)
dc.contributor.authorAsnake Abrham
dc.date.accessioned2024-02-15T07:56:33Z
dc.date.available2024-02-15T07:56:33Z
dc.date.issued2022-09
dc.description.abstractIn 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.
dc.identifier.urihttps://etd.aau.edu.et/handle/123456789/1784
dc.language.isoen_US
dc.publisherAddis Ababa University
dc.subjectNetwork Flows
dc.subjectMaximum Flow Problems
dc.subjectMax-Flow Min-Cut Theorem
dc.subjectGeneric Augmenting Path Algorithm
dc.subjectFord Fulkerson Labeling Method
dc.titleMaximum Flow Problem
dc.typeThesis

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Asnake Abrham 2022.pdf
Size:
1.36 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description:
Download

Collections

Mathematics