Lecture 4 - Two-dimensional computational topology
This series of lectures will describe recent and not-so-recent works in computational topology of curves in the plane and on surfaces. Combinatorial and algorithmic aspects will be discussed.
Lecture 4. Maximum flows and minimum cuts - definitions - flow-cut duality, graph duality, Poincaré duality - planar minimum cuts via MSSP - $\mathbb Z_2$-homology - $\mathbb Z_2$-homology cover - surface mincut via MSSP in homology cover - planar flows via shortest-path pivoting - surface flows via implicit homology-LP