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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing ...
Sort
relevance
views
votes
recent
update
View
thumb
title
23
click to vote
DCG
2006
96
views
more
DCG 2006
»
k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn
13 years 9 months ago
Download
www.ifisica.uaslp.mx
We use circular sequences to give an improved lower bound on the minimum number of ( k)
József Balogh, Gelasio Salazar
claim paper
Read More »
24
click to vote
SODA
2003
ACM
103
views
Algorithms
»
more
SODA 2003
»
On the rectilinear crossing number of complete graphs
13 years 10 months ago
Download
www.inf.ethz.ch
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
Uli Wagner
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »