ECS 222A - Fall 2007 Algorithm Design and Analysis - Gusfield

  • This page links to the course lectures and discussion sections. A list of the topics covered in each lecture can be found at Topics by date

    Lecture Videos

  • Webcast of the first lecture 9-28-07
    Unfortunately, the first 10 minutes of the lecture are missing. See complexity, rules of the game for a written version of this part of the lecture.
  • Webcast of 10-1-07
  • Webcast of 10-3-07
  • Webcast of 10-5-07
  • Webcast of 10-8-07
  • Webcast of 10-10-07
  • Webcast of 10-12-07
  • Webcast of 10-15-07
  • Webcast of 10-17-07
  • Webcast of 10-19-07
  • Webcast of 10-22-07
  • Webcast of 10-24-07
  • Webcast of 10-29-07
  • Webcast of 10-31-07
  • Webcast of 11-2-07
  • Webcast of 11-5-07
  • Webcast of 11-7-07
  • Webcast of 11-9-07
  • Webcast of 11-14-07
  • Webcast of 11-16-07
  • Webcast of 11-19-07
  • Webcast of 11-21-07
  • Webcast of 11-26-07 Some part of the beginning of this lecture was lost. The topic is a deterministic algorithm for global minimum cut in an undirected graph. This algorithm is not discussed in the book, but a randomized algorithm for the problem is discussed, so you can read the start of that discussion for the definition of the problem, and for some other comments on the problem that relate to both the deterministic and the randomized algorithms.
  • Webcast of 11-28-07
  • Webcast of 11-30-07
  • Webcast of 12-3-07
  • Webcast of 12-5-07
  • Webcast of 12-7-07 Oops, at the end of the lecture (the end of the course) things got a bit rushed and I wrote that the DP for independent set for graph G runs in time that is polynomial in w(T) and n and m, where w(T) is the width of the tree decomposition T, and n and m are the number of nodes and edges in the graph G. What is correct is that the DP runs in time that is exponential in w(T) (in fact it contributes a factor of 4^{w(T)}), and polynomial in n and m. The actual running time is something like O(4^{w(T)}nm). The point is that if w(T) is bounded, independent of n and m, then 4^{w(T)} is just a constant number, so independent set problem can be solved in polynomial time as a function of n and m (again if w(T) is bounded independent of n and m). Similarly, even if w(T) is not bounded, if it is small, then the running time is practical for realistic n and m. The smaller w(T) is, the more tree-like is the graph, and the faster the DP. I think I also said something wrong about the approximation bound.
  • Webcast of 12-11-07 Seems to be missing

  • webcast of discussion Oct. 10, 2007
  • webcast of discussion Oct. 17, 2007
  • webcast of discussion Oct. 24, 2007
  • webcast of discussion Oct. 31, 2007
  • webcast of discussion Nov. 7, 2007
  • webcast of discussion Nov. 14, 2007
  • There are no webcasts of discussions between Nov. 14 and Dec. 5, although the videos of those are available.
  • webcast of Discussion Dec. 5, 2007