142 search results - page 8 / 29 » The Diameter of Sparse Random Graphs |
102
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
APPROX
2005
Springer
15 years 5 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
DMTCS
2006
14 years 11 months ago
2006
We consider the problem of generating a random q-colouring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if for all v V the average degree of...
82
Voted
COLOGNETWENTE
2008
15 years 1 months ago
2008
