MTH6105 Algorithmic Graph Theory


Week 11: The Chinese Postman Problem

  Covered this week:
Lecture 1:
Trails and tours in non-Eulerian graphs. Notes PDF file icon
Lecture 2:
The Chinese Postman Problem Notes PDF file icon
Lecture 3:
Notes to follow soon. (Actually, we just went over another example and talked about complexity issues which were non-examinable, so these notes probably aren't necessary)

Week 11 Coursework: watch the boxes below!
Coursework 10
Solutions
Download pdf
Submit: 28.03
Download pdf
Amended 14.04.12

Extra: preview the latest Theorem of the Day: a famous theorem about Euler tours by a QM mathematician

Week 10 Week 12 Back to MTH6105 main page School of Maths Sciences