| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428204 | Information Processing Letters | 2008 | 5 Pages |
Abstract
In [Y. Métivier, N. Saheb, A. Zemmari, Analysis of a randomized rendezvous algorithm, Inform. and Comput. 184 (2003) 109–128], the authors introduce and analyze a randomized procedure to implement handshakes in graphs. In this paper, we investigate the same problem in random graphs. We prove results on the probability of success and we study the distribution of the random variable which counts the number of handshakes in the graph.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
