Homology Flows, Cohomology Cuts ∗ (2009)
Erin W. Chambers, Jeff Erickson, Amir Nayyeri, John Dryden, All For Love, Erin Chambers, ...
We describe the first algorithms to compute maximum flows in surface-embedded graphs in nearlinear time. Specifically, given an undirected graph embedded on an orientable surface of genus g, with two...