Flow Networks, Flows, Cuts: Basic Notions and Examples

Loading...
Del curso dictado por Shanghai Jiao Tong University
Discrete Mathematics
59 calificaciones
Shanghai Jiao Tong University
59 calificaciones
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.

Conoce a los instructores

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

Explora nuestro catálogo

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