Flow Networks, Flows, Cuts: Basic Notions and Examples

video-placeholder
Loading...
Ver programa

Reseñas

3.3 (155 calificaciones)

  • 5 stars
    43,22 %
  • 4 stars
    10,96 %
  • 3 stars
    7,09 %
  • 2 stars
    11,61 %
  • 1 star
    27,09 %

NP

22 de oct. de 2017

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

AG

4 de dic. de 2018

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.