Syllabus
- Introduction (Chapters 1-3)
- Trees (Chapter 4)
- Optimization on Trees: Dynamic Programming
- Graph traversal: DFS and BFS
- Connectivity (Chapter 5)
- Traversability (Chapter 6)
- Brief overview of NP-Completeness theory, the Hamiltonian Cycle
Problem
- The Traveling Salesperson problem
- Matchings and Factorization (Chapter 8)
- Matchings on bipartite graphs
- Maximum flow
- Digraphs (Chapter 7)
- Topological Sort
- Strongly Connected
Components
- Planarity (Chapter 9)
- Coloring (Chapter 10)
- Selected topics:
- Random Walks
- Ramsey numbers
- Domination