CSC 425/520 Class Notes: Fall 2016

For a complete set of notes, please attend class or get notes from someone who attended. Only selected notes will be placed here.

1. Lecture 1: Introduction to CSC 425/CSC 520.
2. Lecture 2: Solving Recurrences Relations.
3. Lecture 3: Review of Algorithm Analysis.
4. Lecture 4: Sample C code.
5. Lecture 5: Dominating set is NP-complete.
6. Lecture 6: An algorithm for dominating set.
7. Lecture 7: Applications of matchings to chemistry.
8. Lecture 8: The Stable Matching Problem
9. Lecture 9: Questions about stable matchings.
10. Lecture 10: Greedy algorithms.
11. Lecture 11: Graphs.
12. Notes on good programming style from Assignment #1
13. Lecture 12: Compressed adjacency matrix.
    Code for compressed adjacency matrices (click here).
    
14. Lecture 13: Approximation algorithm for minimizing Makespan.
15. Lecture 14: 3-SAT and Vertex Cover
16. Lecture 15: Randomized algorithms
17. Lecture 16: Series-parallel graphs (2-trees)
18. Observations on the course project.
19. Lecture 17: A 2-tree algorithm for Hamilton Path
20. Lecture 18: Maximum flow in a network
21. Lecture 19: Vertex connectivity
22. Lecture 20: Maximum flow applications
23. Lecture 21: Tabu search
24. Lecture 22: Simulated Annealing