2 search results - page 1 / 1 » Minimum cuts and shortest homologous cycles |
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
MP
2006
13 years 4 months ago
2006
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...