43 search results - page 1 / 9 » Genus and the Geometry of the Cut Graph |
SODA
2010
ACM
13 years 3 months ago
2010
ACM
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
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...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...