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

- Introduction to CSC 422/522.
- Graphs.
- An algorithm for finding a minimum dominating set.
- Review of BFS.
- Clockwise BFS.
- Graph Isomorphism.
- Automorphism groups.
- A Canonical Form for Trees.
- Isomorphic independent sets.
- Planar Graphs.
- Preprocessing for planar embedding.
- Planar Embedding.
- Queen graphs
- Algorithms for finding a minimum dominating set: this research talk is available from connex under the resources section.
- Mathscinet
- Mathematical Writing for your survey paper.
- Maximum Flow Algorithm
- Using a maximum flow algorithm for vertex connectivity
- Crossing cuts and Gomery-Hu Cut Trees
- Example of a maximum flow problem
- Simulated annealing
- Tabu search

CSC 422/522 Notes / maintained by Wendy Myrvold / wendym@uvic.ca / revised July 13, 2017