Randomized Rendezvous
Yves Métivier, Nasser Saheb, Akka Zemmari · Mathematics and Computer Science · 2000
In this paper we propose and analyze a randomized algorithm to get rendezvous 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.