142 search results - page 1 / 29 » The Diameter of Sparse Random Graphs |
CPC
2010
13 years 2 months ago
2010
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
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...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
CPC
2010
13 years 2 months ago
2010
We study the diameter of C1, the largest component of the Erdos-R