2310 search results - page 124 / 462 » Coloring Random Graphs |
125
Voted
RSA
2006
15 years 4 months ago
2006
We investigate the degree sequences of scale-free random graphs. We obtain a formula for the limiting proportion of vertices with degree d, confirming non-rigorous arguments of Do...
148
click to vote
PODS
2006
ACM
16 years 5 months ago
2006
ACM
The link structure of the Web can be viewed as a massive graph. The preferential attachment model and its variants are well-known random graph models that help explain the evoluti...
140
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
168
click to vote
CN
2010
15 years 1 months ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
118
click to vote
IM
2007
15 years 4 months ago
2007
We examine the relationship of a graph G and its random subgraphs which are defined by independently choosing each edge with probability p. Suppose that G has a spectral gap λ (...