Sciweavers

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

70

Voted

CPC
2010

favoriteEmaildiscussreport

103views more CPC 2010»

The Diameter of Sparse Random Graphs

14 years 6 months ago

The Diameter of Sparse Random Graphs

Download math.ucsd.edu

Oliver Riordan, Nicholas C. Wormald

Real-time Traffic

CPC 2010 | Operations Research |

claim paper

Related Content

» The Diameter of Randomly Perturbed Digraphs and Some Applications

» The diameter of random massive graphs

» External Memory Algorithms for Diameter and AllPairs ShortestPaths on Sparse 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

» High Degree Vertices Eigenvalues and Diameter of Random Apollonian Networks

» Randomized and deterministic algorithms for geometric spanners of small diameter

Post Info
More Details (n/a)

Added	01 Mar 2011
Updated	01 Mar 2011
Type	Journal
Year	2010
Where	CPC
Authors	Oliver Riordan, Nicholas C. Wormald

Comments (0)