50 search results - page 3 / 10 » The Diameter of a Scale-Free Random Graph |
CPC
2010
13 years 3 months ago
2010
We study the diameter of C1, the largest component of the Erdos-R
ALGORITHMICA
2007
13 years 5 months ago
2007
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 ...
WALCOM
2008
IEEE
13 years 7 months ago
2008
IEEE
In this paper, a fast algorithm is proposed to calculate kth power of an n
CPC
2010
13 years 3 months ago
2010
CORR
2011
Springer
13 years 23 days ago
2011
Springer
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...