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
151
click to vote
SODA
2001
ACM
138
views
Algorithms
»
more
SODA 2001
»
The diameter of random massive graphs
15 years 4 months ago
Download
www.math.sc.edu
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...
Linyuan Lu
claim paper
Read More »