Flow Networks, Flows, Cuts: Basic Notions and Examples

Ver programa


3.3 (143 calificaciones)

  • 5 stars
    42,65 %
  • 4 stars
    11,88 %
  • 3 stars
    6,99 %
  • 2 stars
    12,58 %
  • 1 star
    25,87 %


22 de oct. de 2017

Filled StarFilled StarFilled StarFilled StarFilled Star

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


4 de dic. de 2018

Filled StarFilled StarFilled StarFilled StarFilled Star

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

De la lección

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.

Impartido por:

  • Placeholder

    Dominik Scheder

    Assistant Professor

Explora nuestro catálogo

Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.