Sciweavers

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

3

COMPGEOM
2008
ACM

favoriteEmaildiscussreport

76views Discrete Geometry» more COMPGEOM 2008»

Improved upper bounds on the crossing number

12 years 5 months ago

Improved upper bounds on the crossing number

Download cgm.cs.mcgill.ca

Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar

Real-time Traffic

COMPGEOM 2008 | Discrete Geometry |

claim paper

Related Content

» Crossing Number and Weighted Crossing Number of NearPlanar Graphs

» Crossing and Weighted Crossing Number of NearPlanar Graphs

» Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies

» Abstract order type extension and new results on the rectilinear crossing number

» Number of CrossingFree Geometric Graphs vs Triangulations

» RNA Folding Including Pseudoknots A New Parameterized Algorithm and Improved Upper Bound

» A new upper bound on the cyclic chromatic number

» Crossing Minimization meets Simultaneous Drawing

» Improved upper bounds on sizes of codes

Post Info
More Details (n/a)

Added	18 Oct 2010
Updated	18 Oct 2010
Type	Conference
Year	2008
Where	COMPGEOM
Authors	Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood

Comments (0)