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
592
search results - page 11 / 119
»
Crossing numbers of random graphs
Sort
relevance
views
votes
recent
update
View
thumb
title
103
click to vote
CPC
2008
67
views
more
CPC 2008
»
On the Strong Chromatic Number of Random Graphs
15 years 5 months ago
Download
www.math.ucla.edu
Po-Shen Loh, Benny Sudakov
claim paper
Read More »
138
click to vote
CPC
2006
91
views
more
CPC 2006
»
On the Independent Domination Number of Random Regular Graphs
15 years 5 months ago
Download
www.math.uwaterloo.ca
William Duckworth, Nicholas C. Wormald
claim paper
Read More »
103
Voted
CPC
2004
65
views
more
CPC 2004
»
On the b-Independence Number of Sparse Random Graphs
15 years 5 months ago
Download
www.math.cmu.edu
Geoffrey Atkinson, Alan M. Frieze
claim paper
Read More »
115
Voted
CPC
2002
76
views
more
CPC 2002
»
Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number
15 years 5 months ago
Download
www.math.cmu.edu
Colin Cooper, Alan M. Frieze, Bruce A. Reed, Olive...
claim paper
Read More »
157
click to vote
GD
2009
Springer
208
views
Computer Graphics
»
more
GD 2009
»
Complexity of Some Geometric and Topological Problems
15 years 8 months ago
Download
ovid.cs.depaul.edu
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
Marcus Schaefer
claim paper
Read More »
« Prev
« First
page 11 / 119
Last »
Next »