\documentclass{article}
\usepackage{graphicx}
\pagestyle{empty}

\begin{document}
\begin{center}
{\LARGE CS140: Algorithms }\\
\vspace{.1 in}
{\Large Fall 2001}\\
\vspace{.3 in}
{\large Assignment 7}
\end{center}

\noindent
This assignment is due by noon Friday, October 19.  You may collaborate
with your classmates to complete this assignment but you must reference your collaborators.  In addition,
you must do your own write-up.  This assignment is worth 100 points (65 points if handwritten except you may submit hand drawn solutions to problem 1).  


\vspace{.2 in}
\begin{enumerate}

\item 
Use the Karp-Edmonds algorithm to determine the maximum flow in the
following network.  Show the residual graph and augmenting path at
each step.   (The leftmost node is the source and the rightmost node 
is the sink.) 

\begin{figure}[h]
\centering
\includegraphics{netflow}
\end{figure}

\vspace{.5 in}

\item

Problem 27-1 on page 625 of the  text.

\item

Problem 27-2 on page 626 of the text.


\item
Problem 31.2.6 on page 745 of the text.




\end{enumerate}
\end{document}

