Name
Abstract | ||
|---|---|---|
We study the relation between the performance of the randomized rumor spreading (push model) in a d-regular graph G and the performance of the same algorithm in the percolated graph G_p. We show that if the push model successfully broadcast the rumor within T rounds in the graph G then only (1 + \epsilon)T rounds are needed to spread the rumor in the graph G_p when T = o(pd). |
Year | Venue | Keywords |
|---|---|---|
2011 | CoRR | discrete mathematics,regular graph |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Line graph,Graph power,Simplex graph,Distance-hereditary graph,Regular graph,Butterfly graph,Windmill graph,Mathematics,Voltage graph | Journal | abs/1110.1044 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roberto I. Oliveira | 1 | 0 | 0.34 |
| Alan Prata | 2 | 0 | 0.34 |