We say that an undirected graph is k-connected if at least k edges
must be removed to disconnect the graph.  For example a tree is
1-connected and a cycle is 2-connected.  Let G=(V,E) be an undirected
graph.  Show how we can compute the largest k such that G is
k-connected by solving at most |V| max-flow problems, each on a
flow-network with O(V) vertices and O(E) edges.