Topics for the Week of April 7, 2008
CS343: Analysis of Algorithms

• Reading: begin Chapter 7 Network Flow (e.g. sections 1 & 2)

• Homework:

  • Turn in chp 6 written problems.
  • Demo and turn in Bellman-Ford program.
  • Go over LCS algorithm.

• Finish discussion of Chapter 6: Dynamic Programming

• Begin discussion of Chapter 7: Network Flow

  • The Max-Flow Problem: Ford-Fulkerson

• DP Applications

  • Longest common subsequence (LCS)
  • Matrix Chain