Flow Networks: The Maxflow - Mincut Theorem

From the course by Shanghai Jiao Tong University
Discrete Mathematics
50 ratings
Shanghai Jiao Tong University
50 ratings
From the lesson
Maximum flow and minimum cut
This module is about flow networks and has a distinctively algorithmic flavor. We prove the maximum flow minimum cut duality theorem.

Meet the Instructors

  • Dominik Scheder
    Dominik Scheder
    Assistant Professor
    The Department of Computer Science and Engineering