Sciweavers

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

23

FCT
2009
Springer

favoriteEmaildiscussreport

105views Applied Computing» more FCT 2009»

On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs

14 years 5 months ago

On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs

Download s_k_ghosh.tripod.com

Subhas Kumar Ghosh, Koushik Sinha

Real-time Traffic

FCT 2009 | Theoretical Computer Science |

claim paper

Related Content

» On a Conjecture Related to Geometric Routing

» Nodally 3connected planar graphs and convex combination mappings

» Some Results on Greedy Embeddings in Metric Spaces

» Chords of longest circuits in locally planar graphs

» Spherical representation and polyhedron routing for load balancing in wireless sensor netw...

» Greedy drawings of triangulations

» Small Grid Embeddings of 3Polytopes

» How to Exhibit Toroidal Maps in Space

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	FCT
Authors	Subhas Kumar Ghosh, Koushik Sinha

Comments (0)