Maximum Flow Problem

We can set a dial at each node to determine how much of the water coming into the node will exit through each of the pipes. This determines a flow.

How do we set these dials to maximize the total flow from source to sink?

Can be solved efficiently using a generalization of augmenting paths: tex2html_wrap_inline143 . (Even better algorithms are available; well studied problem.)

Example flow...


next up previous
Next: Matching as Network Flow Up: NETWORK FLOW Previous: Network Flow