Flow Networks, Flows, Cuts: Basic Notions and Examples

Loading...
Do curso por Shanghai Jiao Tong University
Discrete Mathematics
59 ratings
Shanghai Jiao Tong University
59 ratings
Na lição
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.

Conheça os instrutores

  • Dominik Scheder
    Dominik Scheder
    Assistant Professor
    The Department of Computer Science and Engineering

Explore nosso catálogo

Registre-se gratuitamente e obtenha recomendações, atualizações e ofertas personalizadas.