Flow Networks: The Maxflow - Mincut Theorem

Loading...
來自 Shanghai Jiao Tong University 的課程
Discrete Mathematics
60 個評分
Shanghai Jiao Tong University
60 個評分
從本節課中
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
    The Department of Computer Science and Engineering

探索我們的目錄

免費加入並獲得個性化推薦、更新和優惠。