Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

SODA
2001
ACM

favoriteEmaildiscussreport

138views Algorithms» more SODA 2001»

The diameter of random massive graphs

13 years 5 months ago

The diameter of random massive graphs

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 determine the diameter of random power law graphs up to a constant factor for almost all ranges of parameters. These results show a strong evidence that the diameters of most massive graphs are about logarithm of their sizes up to a constant factor.

Linyuan Lu

Real-time Traffic

Algorithms | Constant Factor | Many Massive Graphs | Power Law | SODA 2001 |

claim paper

Related Content

» Fast computation of empirically tight bounds for the diameter of massive graphs

» Diameters in Supercritical Random Graphs Via First Passage Percolation

» Random Geometric Graph Diameter in the Unit Ball

» A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Rando...

» The Diameter of a ScaleFree Random Graph

» The Diameter of Sparse Random Graphs

» High Degree Vertices Eigenvalues and Diameter of Random Apollonian Networks

» A random graph model for massive graphs

» The Diameter of Randomly Perturbed Digraphs and Some Applications

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2001
Where	SODA
Authors	Linyuan Lu

Comments (0)