Search Sciweavers | Sciweavers

61 search results - page 1 / 13

» The diameter of random massive graphs

click to vote

SODA
2001
ACM

138views Algorithms» more SODA 2001»

The diameter of random massive graphs

13 years 6 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 »

click to vote

JEA
2008

64views more JEA 2008»

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

13 years 4 months ago

Download www-rp.lip6.fr

Clémence Magnien, Matthieu Latapy, Michel H...

claim paper

Read More »

click to vote

CPC
2010

117views more CPC 2010»

Diameters in Supercritical Random Graphs Via First Passage Percolation

13 years 2 months ago

Download research.microsoft.com

We study the diameter of C1, the largest component of the Erdos-R

Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Per...

claim paper

Read More »

click to vote

ALGORITHMICA
2007

117views more ALGORITHMICA 2007»

Random Geometric Graph Diameter in the Unit Ball

13 years 5 months ago

Download math.iit.edu

The unit ball random geometric graph G = Gd p(λ, n) has as its vertices n points distributed independently and uniformly in the unit ball in Rd, with two vertices adjacent if and ...

Robert B. Ellis, Jeremy L. Martin, Catherine H. Ya...

claim paper

Read More »

click to vote

WALCOM
2008
IEEE

127views Algorithms» more WALCOM 2008»

A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs

13 years 6 months ago