Lecture notes, page 1/13 •
[previous page] •
[next page] •
[PDF]
Lecture notes, page 1/13 • [previous page] • [next page] • [PDF]
[+] Maximum flow in planar graphs with multiple sources and sinks |
| We discuss how to find a maximum flow in a planar flow network with multiple sources and sinks. We introduce pseudoflows and define a sense in which a pseudoflow is maximum. The heart of the lecture is a procedure for eliminating residual paths between vertices with positive and negative inflow on a cycle, which is used by a recursive algorithm for the maximum flow problem. |
|
Lecture notes, page 1/13 •
[previous page] •
[next page] •
[PDF]
Lecture notes, page 1/13 • [previous page] • [next page] • [PDF] |
|
The video above should play if your web browser supports either modern Flash or HTML5 video with H.264 or WebM codec. The lecture notes should advance automatically. If you have any trouble with playback, email me.