Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
84
click to vote
DCG
2010
93
views
more
DCG 2010
»
General Lower Bounds for the Minor Crossing Number of Graphs
15 years 3 months ago
Download
www.imfm.si
Drago Bokal, Éva Czabarka, Lászl&oac
Real-time Traffic
DCG 2010
|
claim paper
Related Content
»
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
»
On the rectilinear crossing number of complete graphs
»
On crossing numbers of geometric proximity graphs
»
CrossComposition A New Technique for Kernelization Lower Bounds
»
Complete Minors and Independence Number
»
Crossing Number and Weighted Crossing Number of NearPlanar Graphs
»
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
»
A central approach to bound the number of crossings in a generalized configuration
»
kSets Convex Quadrilaterals and the Rectilinear Crossing Number of Kn
more »
Post Info
More Details (n/a)
Added
10 Dec 2010
Updated
10 Dec 2010
Type
Journal
Year
2010
Where
DCG
Authors
Drago Bokal, Éva Czabarka, László A. Székely, Imrich Vrt'o
Comments
(0)
Researcher Info
DCG 1998 Study Group
Computer Vision