StraighterLine_WGU College of Business_Bachelor General Education_v032014
StraighterLine_WGU College of Business_Bachelor General Education_v032014 : WGU- College of Business
Transfer Guidelines for Western Governors
University - College of Business
Degre
Algo 2014 - School Solution to Exercise 8
1. The edge connectivity of an undirected graph is the minimum number k of edges that
must be removed to disconnect the graph. Give an algorithm that determines the edge
connectivity.
Hint: run the maximal-ow algo
Algo 2014 - Exercise 11 - School Solution
Write at the beginning of the exercise the page each questions solution is on.
z0
1
.
i
1. (25 pts) Recall that DF Tn 1 (z0 , . . . , zn1 ) = Mn 1 . , where (Mn 1 )ij = n (n )j .
.
zn1
Prove that the following rec
Algo 2014 - Exercise 9
Submit by: Thursday 26.12.13 at 23:55
Write at the beginning of the exercise the page each questions solution is on.
1. (33 pt.)
Halls generalized theorem: Let G = (L, R, E ) be a bipartite graph.
For every X L, denote (X ) = cfw_y