Flow Networks, Flows, Cuts: Basic Notions and Examples

Loading...
Visualiser le programme de cours

Avis

3.5 (113 évaluations)
  • 5 stars
    47%
  • 4 stars
    12%
  • 3 stars
    7%
  • 2 stars
    12%
  • 1 star
    21%
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.

À 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

  • Dominik Scheder

    Dominik Scheder

    Assistant Professor

Explorer notre catalogue

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