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

9
Advanced/Graph Algorithms/parts/04 applications.tex
View File

@ -86,8 +86,9 @@ A matching is \textit{maximal} if it has more edges than any other matching.
\vspace{5mm}
Devise an algorithm to find a maximal matching in any bipartite graph. \\
Find an upper bound for its runtime.
Create an algorithm that finds a maximal matching in any bipartite graph. \\
Find an upper bound for its runtime. \\
\hint{Can you modify an algorithm we already know?}
\begin{solution}
Turn this into a maximum flow problem and use FF. \\
@ -101,7 +102,7 @@ Find an upper bound for its runtime.
\vfill
\pagebreak
\problem{Circulations with Demand}
\problem{Supply and Demand}
Say we have a network of cities and power stations. Stations produce power; cities consume it.
@ -146,7 +147,7 @@ We'll represent station capacity with a negative number, since they \textit{cons
\end{tikzpicture}
\end{center}
We'd like to know if there exists a \textit{feasible circulation} in this network---that is, can we supply our cities with the energy they need without exceeding the capacity of power plants or transmission lines?
We'd like to know if there exists a \textit{feasible circulation} in this network---that is, can we supply our cities with the energy they need without exceeding the capacity of our power plants and transmission lines?
\vspace{2ex}