Sciweavers

98
Voted
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
15 years 10 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri