142 search results - page 2 / 29 » The Diameter of Sparse Random Graphs |
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
COMBINATORICA
2004
13 years 5 months ago
2004
CORR
2011
Springer
13 years 16 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...
FOCS
1994
IEEE
13 years 9 months ago
1994
IEEE
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...