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

Ознакомьтесь с нашим каталогом

Присоединяйтесь бесплатно и получайте персонализированные рекомендации, обновления и предложения.