Flow Networks, Flows, Cuts: Basic Notions and Examples

Loading...
En provenance du cours de Shanghai Jiao Tong University
Discrete Mathematics
75 notes
Shanghai Jiao Tong University
75 notes
À 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.

Rencontrer les enseignants

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

Explorer notre catalogue

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