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...
Erin Chambers, Jeff Erickson, Amir Nayyeri, Erin Chambers, Jeff Erickson, Amir Nayyeri
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in nearlinear time. Given an undirected graph embedded on an orientable surface of genus g, with two specified...
Splitting (Complicated) Surfaces is Hard (2006)
Chambers, Erin, Colin De Verdière, Éric, Erickson, Jeff, Lazarus, Francis, Whittlesey, Kim
Let $\MM$ be an orientable combinatorial surface without boundary. A cycle on $\MM$ is \emph{splitting} if it has no self-intersections and it partitions $\MM$ into two components, neither of which...
Splitting (Complicated) Surfaces is Hard (2006)
Chambers, Erin, Colin De Verdière, Éric, Erickson, Jeff, Lazarus, Francis, Whittlesey, Kim
Let $\MM$ be an orientable combinatorial surface without boundary. A cycle on $\MM$ is \emph{splitting} if it has no self-intersections and it partitions $\MM$ into two components, neither of which...
Splitting (Complicated) Surfaces is Hard (2006)
Chambers, Erin, Colin De Verdière, Éric, Erickson, Jeff, Lazarus, Francis, Whittlesey, Kim
Let $\MM$ be an orientable combinatorial surface without boundary. A cycle on $\MM$ is \emph{splitting} if it has no self-intersections and it partitions $\MM$ into two components, neither of which...
Splitting (Complicated) Surfaces is Hard (2006)
Chambers, Erin, Colin De Verdière, Éric, Erickson, Jeff, Lazarus, Francis, Whittlesey, Kim
Let $\MM$ be an orientable combinatorial surface without boundary. A cycle on $\MM$ is \emph{splitting} if it has no self-intersections and it partitions $\MM$ into two components, neither of which...