Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers (2011)

by Jeff Erickson , Amir Nayyeri
Venue:SYMPOSIUM ON DISCRETE ALGORITHMS
Citations:9 - 3 self

Active Bibliography

17 Minimum Cuts and Shortest Homologous Cycles – Erin Chambers, Jeff Erickson, Amir Nayyeri - 2009
Combinatorial Optimization of Cycles and Bases – Jeff Erickson
15 Homology flows, cohomology cuts – Erin W. Chambers, Jeff Erickson, Amir Nayyeri - 2009
2 Global Minimum Cuts in Surface Embedded Graphs – Jeff Erickson, Kyle Fox, Amir Nayyeri
4 Shortest non-trivial cycles in directed surface graphs – Jeff Erickson - 2011
Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs – Kyle Fox
1 Faster shortest non-contractible cycles in directed surface graphs – Kyle Fox
25 Tightening Non-Simple Paths and Cycles on Surfaces – Éric Colin de Verdière, Jeff Erickson
7 Multiplesource shortest paths in embedded graphs – Sergio Cabello, Erin W. Chambers, Jeff Erickson - 2012
8 Computing the shortest essential cycle – Jeff Erickson, Pratik Worah - 2008
5 Finding shortest contractible and shortest separating cycles in embedded graphs – Sergio Cabello
6 Output-Sensitive Algorithm for the Edge-Width of an Embedded Graph – Sergio Cabello, Éric Colin de Verdière, Francis Lazarus - 2010
3 Testing contractibility in planar Rips complexes – Erin W. Chambers, Jeff Erickson, Pratik Worah
13 Finding one tight cycle – Sergio Cabello, Matt Devos, Jeff Erickson
6 Maximum Flows and Parametric Shortest Paths in Planar Graphs – Jeff Erickson
9 Finding shortest non-trivial cycles in directed graphs on surfaces – Sergio Cabello, Francis Lazarus, Éric Colin De Verdière - 2010
39 Finding shortest non-separating and non-contractible cycles for topologically embedded graphs – Sergio Cabello, Bojan Mohar - 2005
21 Splitting (complicated) surfaces is hard – Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Kim Whittlesey - 2006
1 Shortest Non-Crossing Walks in the Plane – Jeff Erickson, Amir Nayyeri - 2010