[Adapt] (no subject)

[黄姗姗]

Hello everyone,
    Tomorrow afternoon I will give a talk on Maximum Flow Algorithms at 4:30pm, 3-528.
    In he Maximum Flow Algorithms, we wish to compute the greatest rate at which we can ship materials from the source to the sink without violating any capacity constrains.
    I mainly introduce two general methods for solving the maximum flow problem:Ford and Fulkerson method and push-relabel method. And in the end I will cover relabel-to-front algorithm, a paticular implementation of the push-relabel method that runs in time O(V^3).
  
 Thanks,
 Shanshan.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs.sjtu.edu.cn/pipermail/adapt/attachments/20161206/679bcbf0/attachment.html>