Contents (hide)
MST

Class material Supplements

  1. Reductions

    • This week tutorial Tutorial1-Reductions.pdf
    • A very nice tutorial can be found here.

      The reduction presented in this tutorial is $SP \le SEP$. It was briefly given in class. Here it is accompanied with some very detailed comments and explanations regarding the way of thinking and the formality of proofs.


  2. Greedy


  3. MST


  4. Dynamic programing


  5. Dijkstra


  6. Bellman Ford


  7. DFS,Topological Sort and Gscc


  8. Flow 1


  9. Dinitz' Algorithm


  10. Flow, Randomized Algorithms


  11. Inroduction to Complexity and more Randomized….


  12. Inroduction to Complexity (Part A)


  13. Inroduction to Complexity (Part B)