MTH6105 - Algorithmic Graph Theory - 2023/24
You do not have the permission to view discussions in this forum
| Topic | Name | Description |
|---|---|---|
These are typed lecture notes for the module in a single file. They will be updated as the module progresses. Unless explicitly noted otherwise, all material in the notes is examinable. If you find any errors or inconsistencies, please inform the module organiser. |
||
| Study Period | ||
| Week 1 - Introduction | ||
This is a copy of what I have written and projected during lectures. The official version of the lecture notes is the typed version, which you can find at the top of the page. |
||
| Week 2 - Paths, Cycles, Trees | ||
| Assessed Coursework | ||
| Final exam | ||
| Week 3 - Trees | ||
| Week 4 - Spanning Trees, Complexity of Algorithms, Graph Traversal | ||
| Week 5 - Graph Traversal, Minimum Spanning Trees | ||
| Week 6 - Minimum Spanning Trees, Shortest Paths | ||
| Week 8 - Shortest Paths, Negative Cycles, Longest Paths | ||
| Week 9 - Network Flows | ||
| Week 10 - Network Flows, Matchings | ||
| Week 11 - Matchings | ||
| Week 12 - Matchings, Euler Trails | ||
| Additional Material | An episode of the BBC's In Our Time on mathematician Paul Erdős. It features graphs and one of the exercises on Problem Sheet 1. |
