Flow Networks: The Maxflow - Mincut Theorem

Loading...
From the course by Shanghai Jiao Tong University
Discrete Mathematics
56 оценки
Shanghai Jiao Tong University
56 оценки
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

Ознакомьтесь с нашим каталогом

Присоединяйтесь бесплатно и получайте персонализированные рекомендации, обновления и предложения.