Thursday, January 29, 2009
Thursday, February 5, 2009
- Please review the
- You must write down with whom you worked on the assignment. If this
changes from problem to problem, then you should write down this
information separately with each problem.
- Numbered problems are all from the textbook Network Flows .
- Problem 13.14. Tree minimax result.
- Problem 13.34. Balanced Spanning Trees
- Suppose I have a graph G with n nodes and 5n edges. For a spanning tree F, we define h(F) to be the number of F-heavy edges in G. Give upper and lower
bounds on h(F) in terms of n. Repeat the problem for a complete graph (with n(n-1)/2 edges)
- Problem 4.6. Cluster Analysis.
- Suppose that we order the edge relaxations in each pass of the
Bellman-Ford algorithm as follows. Before the first pass, we assign
an arbitrary linear order v1,v2,...,vn
to the vertices of the input graph.
Then, we partition the edge set E into Ef and Eb, where Ef are the forward edges, i.e. the ones of the form (vi,vj) with i < j and
Eb, the backwards edges, i.e. the ones of the form (vi,vj) with i> j.
Define Gf=(V,Ef) and Gb=(V,Eb).
- Prove that Gf is acyclic with topological sort v1,v2,...,vn and
that Gb is acyclic with
topological sort vn,vn-1,...,v1
Suppose that we implement each pass of the Bellman-Ford
algorithm in the following way. We visit each vertex in the order
v1, v2, ... , vn, relaxing edges of Ef that leave
the vertex. We then visit each vertex in the order vn,
vn-1, ..., v1, relaxing edges of Eb that leave the vertex.
Prove that with this scheme, if G contains no
negative-weight cycles that are reachable from the source vertex s
then after only ceiling(n/2) passes over the edges, d(v) is the correct
shortest path distance for each vertex v.
- Does this scheme improve the asymptotic running time of
the Bellman-Ford algorithm?