Flow Networks: The Maxflow - Mincut Theorem

Loading...
来自 上海交通大学 的课程
Discrete Mathematics
52 评分
上海交通大学
52 评分
从本节课中
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

探索我们的目录

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