Sciweavers

61 search results - page 2 / 13
» The diameter of random massive graphs
Sort
View
COMBINATORICA
2004
88views more  COMBINATORICA 2004»
14 years 9 months ago
The Diameter of a Scale-Free Random Graph
Béla Bollobás, Oliver Riordan
70
Voted
CPC
2010
103views more  CPC 2010»
14 years 6 months ago
The Diameter of Sparse Random Graphs
Oliver Riordan, Nicholas C. Wormald
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 4 months ago
High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks
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...
Alan M. Frieze, Charalampos E. Tsourakakis
STOC
2000
ACM
112views Algorithms» more  STOC 2000»
15 years 1 months ago
A random graph model for massive graphs
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
William Aiello, Fan R. K. Chung, Linyuan Lu
APPROX
2004
Springer
135views Algorithms» more  APPROX 2004»
15 years 2 months ago
The Diameter of Randomly Perturbed Digraphs and Some Applications.
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
Abraham Flaxman, Alan M. Frieze