Sciweavers

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

7

JGT
2006

favoriteEmaildiscussreport

73views more JGT 2006»

Nearly light cycles in embedded graphs and crossing-critical graphs

13 years 4 months ago

Nearly light cycles in embedded graphs and crossing-critical graphs

Download www.ifisica.uaslp.mx

We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly

Mario Lomelí, Gelasio Salazar

Real-time Traffic

Embedded Graph | Face Boundaries | JGT 2006 | Lower Bound |

claim paper

Related Content

» A randomized embedding algorithm for trees

» Access PatternBased Code Compression for MemoryConstrained Embedded Systems

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JGT
Authors	Mario Lomelí, Gelasio Salazar

Comments (0)