Sciweavers

SODA
2001
ACM
138views Algorithms» more  SODA 2001»
13 years 6 months ago
The diameter of random massive graphs
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