Flow Networks, Flows, Cuts: Basic Notions and Examples

Loading...
上海交通大学
3.5(94 个评分) | 23K 名学生已注册
查看授课大纲

审阅

3.5(94 个评分)
  • 5 stars
    45 ratings
  • 4 stars
    13 ratings
  • 3 stars
    5 ratings
  • 2 stars
    9 ratings
  • 1 star
    22 ratings

This course is good to comprehend relation, function and combinations.

Short course!! I use it to review my discrete math knowledge.

从本节课中
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

探索我们的目录

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