43 search results - page 2 / 9 » Genus and the Geometry of the Cut Graph |
CORR
2002
Springer
13 years 5 months ago
2002
Springer
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
SMA
2003
ACM
13 years 10 months ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
IPCO
2008
13 years 6 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
JCT
2002
13 years 5 months ago
2002
It is proved that there is a function f : N N such that the following holds. Let G be a graph embedded in a surface of Euler genus g with all faces of even size and with edge-wid...