MTH6105 Algorithmic Graph Theory

Week 6: Maximum Network Flows 2

  Covered this week:
Lecture 1:
Combining flows and capacities: f -unsaturated paths from s to t. Notes PDF file icon
Lecture 2:
The Ford-Fulkerson Algorithm. Notes PDF file icon
Lecture 3:
Correctness of Ford-Fulkerson and the Max-flow Min-cut Theorem. Notes PDF file icon

Week 6 Coursework: watch the boxes below!
Coursework 6
Download pdf
Submit: 29.02 (Week 8)
Accompanying pdf image file
Download pdf

Extra: the Max-flow Min-cut Theorem at

Week 5 Week 7 Back to MTH6105 main page School of Maths Sciences