Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

SODA
2010
ACM

favoriteEmaildiscussreport

106views Algorithms» more SODA 2010»

Genus and the Geometry of the Cut Graph

13 years 2 months ago

Genus and the Geometry of the Cut Graph

Download ttic.uchicago.edu

James R. Lee, Anastasios Sidiropoulos

Real-time Traffic

Algorithms | SODA 2010 |

claim paper

Related Content

» Randomly removing g handles at once

» Probabilistic embeddings of bounded genus graphs into planar graphs

» Minimum cuts and shortest homologous cycles

» On the geometry of graphs with a forbidden minor

» Optimally cutting a surface into a disk

» Graph based topological analysis of tessellated surfaces

» Global minimum cuts in surface embedded graphs

» New GeometryInspired Relaxations and Algorithms for the Metric Steiner Tree Problem

» Coloring Locally Bipartite Graphs on Surfaces

Post Info
More Details (n/a)

Added	30 Jan 2011
Updated	30 Jan 2011
Type	Journal
Year	2010
Where	SODA
Authors	James R. Lee, Anastasios Sidiropoulos

Comments (0)