Flow Networks, Flows, Cuts: Basic Notions and Examples

video-placeholder
Loading...
Visualiser le programme de cours

Avis

3.4 (133 évaluations)
  • 5 stars
    43,60 %
  • 4 stars
    12,78 %
  • 3 stars
    7,51 %
  • 2 stars
    12,03 %
  • 1 star
    24,06 %

NP

22 oct. 2017

Filled StarFilled StarFilled StarFilled StarFilled Star

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

AG

4 déc. 2018

Filled StarFilled StarFilled StarFilled StarFilled Star

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

À partir de la leçon

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.

Enseigné par

  • Placeholder

    Dominik Scheder

    Assistant Professor

Explorer notre catalogue

Rejoignez-nous gratuitement et obtenez des recommendations, des mises à jour et des offres personnalisées.