Mathematics Tripos Papers

  • Part IA
  • Part IB
  • Part II
  • FAQ

1.I.8C

Optimization | Part IB, 2007

State and prove the max-flow min-cut theorem for network flows.

Typos? Please submit corrections to this page on GitHub.