\documentstyle[11pt,handout]{article}
\begin{document}
\input{macros}
\input{/home/rraj/Courses/3390/S99/macros/localmacros}
\thispagestyle{empty}
\setlength{\parindent}{0pt}
\setlength{\parskip}{1.8ex}

\head{3390}{Analysis of Algorithms}{Spring 1999}{26 May 1999}{22}

\begin{center}
\Large{\bf Problem of the Week -- 10}
\end{center}

\bigskip

The {\em edge connectivity}\/ of an undirected graph is the minimum number $k$
of edges that must be removed to disconnect the graph.  For example, the edge
connectivity of a tree is $1$, while the edge connectivity of a cycle is $2$.
Using $O(V)$ invocations of the maximum-flow algorithm, design an algorithm to
compute the edge connectivity of a given undirected graph $G = (V, E)$.  Prove
the correctness of your algorithm.
\end{document}