Mark/handouts
1
0
Fork 0
Code Pull Requests 1 Actions Packages Releases Activity

Applied edits to network flow handout

Browse Source
This commit is contained in:
Mark
2023-01-08 09:10:54 -08:00
parent 9cec9430b8
commit 3ca7393759
8 changed files with 35 additions and 70 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Advanced/Graph Algorithms/parts/03 fulkerson.tex
View File

@ -108,7 +108,7 @@ There is extra space on the next page.
\pagebreak
\problem{}
You are given a large network. How would you quickly find an upper bound for the number of iterations the Ford-Fulkerson algorithm will need to find a maximum flow?
You are given a large network. How can you quickly find an upper bound for the number of iterations the Ford-Fulkerson algorithm will need to find a maximum flow?
\begin{solution}
Each iteration adds at least one unit of flow. So, we will find a maximum flow in at most $\min(\text{flow out of } S,~\text{flow into } T)$ iterations.