598 search results - page 16 / 120 » A random graph model for massive graphs |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
HT
2010
ACM
14 years 28 days ago
2010
ACM
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
STOC
1994
ACM
14 years 3 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. Consider for an even d 4, a random d-regular graph model formed from d/2 uniform, independent permutat...
DATE
2007
IEEE
14 years 5 months ago
2007
IEEE
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...