Flow Networks: The Maxflow - Mincut Theorem

Loading...
来自 Shanghai Jiao Tong University 的课程
Discrete Mathematics
75 个评分
Shanghai Jiao Tong University
75 个评分
从本节课中
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.

与讲师见面

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

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。