Flow Networks, Flows, Cuts: Basic Notions and Examples

Loading...
查看授课大纲

审阅

3.5(118 个评分)
  • 5 stars
    46.61%
  • 4 stars
    11.86%
  • 3 stars
    6.77%
  • 2 stars
    11.86%
  • 1 star
    22.88%
NP

Oct 23, 2017

Fantastic course. Fascinating material, presented at a reasonably fast pace, and some really challenging assignments.

AG

Dec 05, 2018

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

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

探索我们的目录

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