Sciweavers

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

110

Voted

COMPGEOM
2007
ACM

115views Discrete Geometry» more COMPGEOM 2007»

Probabilistic embeddings of bounded genus graphs into planar graphs

15 years 6 months ago

Probabilistic embeddings of bounded genus graphs into planar graphs

Download www.mit.edu

Piotr Indyk, Anastasios Sidiropoulos

Real-time Traffic

COMPGEOM 2007 | Discrete Geometry |

claim paper

Related Content

» Randomly removing g handles at once

» On self duality of pathwidth in polyhedral graph embeddings

» PolynomialTime Approximation Schemes for SubsetConnectivity Problems in BoundedGenus Graph...

» Connecting face hitting sets in planar graphs

» Computing the Girth of a Planar Graph

» A polynomial time algorithm for determining zero EulerPetrie genus of an Eulerian graph

» Spectral radius of finite and infinite planar graphs and of graphs of bounded genus

» Global minimum cuts in surface embedded graphs

» The Bidimensional Theory of BoundedGenus Graphs

Post Info
More Details (n/a)

Added	14 Aug 2010
Updated	14 Aug 2010
Type	Conference
Year	2007
Where	COMPGEOM
Authors	Piotr Indyk, Anastasios Sidiropoulos

Comments (0)