

Covered this week:
 Lecture 1:
 The Maximal_Subtree algorithm and applications.
Notes (not quite what we covered in the lecture—I decided to put all the definitions in one place, Maximal_Subtree now appears in L2 notes).
 Lecture 2:
 Some lemmas giving ... proof of correctness of Maximal_Subtree algorithm.
Notes updated 24.01.12 (again diverging from
the lecturethey cover the maximum vs maximal distinction and specify
Maximal_Subtree, with an example)
 Lecture 3:
 Complexity analysis of Maximal_Subtree algorithm.
Notes (complexity + correctness in this set)
