Solvability of the asynchronous ranking problem
Information Processing Letters
Uniform self-stabilizing rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
A hundred impossibility proofs for distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Introduction to algorithms
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Randomized algorithms
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Handbook of Discrete and Combinatorial Mathematics, Second Edition
Handbook of Discrete and Combinatorial Mathematics, Second Edition
On handshakes in random graphs
Information Processing Letters
Mobile Agents Implementing Local Computations in Graphs
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Efficient distributed handshake using mobile agents
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
| Hi-index | 0.01 |
In this paper we propose and analyze a randomized algorithm to get rendezvous between neighbours in an anonymous graph. We examine in particular the probability to obtain at least one rendezvous and the expected number of rendezvous. We study the rendezvous number distribution in the cases of chain graphs, rings, and complete graphs. The last part is devoted to the efficiency of the proposed algorithm.