\newpage
\Large{\textbf{References}}
\\[5pt]
\footnotesize
{
\begin{enumerate}
\item Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer, Dordrecht (2003)
\item Angluin, D.: Local and global properties in networks of processors. In: Proc. 12th Symposium on Theory of Computing (STOC 1980), pp. 82–93 (1980)
\item Boldi, P., Codenotti, B., Gemmell, P., Shammah, S., Simon, J., Vigna, S.: Symmetry breaking in anonymous networks: characterizations. In: Proc. 4th Israeli Symp. on Theory of Computing and Systems (ISTCS 1996), pp. 16–26 (1996)
\item Barri`ere, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Can we elect if we cannot compare? In: Proc. 15th Symp. on Parallel Algorithms and Architectures (SPAA), pp. 324–332 (2003)
\item Baston, V., Gal, S.: Rendezvous search when marks are left at the starting points. Naval Research Logistics 48(8), 722–731 (2001)
\item Boldi, P., Vigna, S.: Fibrations of graphs. Discrete Mathematics 243(1-3), 21–66 (2002)
\item Chalopin, J., Godard, E., M ́etivier, Y., Ossamy, R.: Mobile agent algorithms versus message passing algorithms. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 187–201. Springer, Heidelberg (2006)
\item Chalopin, J., Godard, E., M ́etivier, Y., Tel, G.: About the termination detection in the asynchronous message passing model. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl ́aˇsil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 200–211. Springer, Heidelberg (2007)
\item Chalopin, J.: Election and rendezvous with incomparable labels. Theoretical Computer Science 399(1-2), 54–70 (2008)
\item Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. In: Proc. ACM Symp. on Discrete Algorithms (SODA 2010), pp. 22–30 (2010)
\item Das, S., Flocchini, P., Nayak, A., Kutten, S., Santoro, N.: Map Construction of Unknown Graphs by Multiple Agents. Theoretical Computer Science 385(1-3), 34– 48 (2007)
\item Das, S., Flocchini, P., Nayak, A., Santoro, N.: Effective elections for anonymous mobile agents. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 732–743. Springer, Heidelberg (2006)
\item Fraigniaud, P., Pelc, A.: Deterministic rendezvous in trees with little memory. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 242–256. Springer, Heidel- berg (2008)
\item Klasing, R., Kosowski, A., Navarra, A.: Taking advantage of symmetries: Gathering of asynchronous oblivious robots on a ring. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 446–462. Springer, Heidelberg (2008)
\item Lov ́asz, L., Plummer, M.D.: Matching Theory. Annals of Discrete Mathematics, vol. 29. North-Holland, Amsterdam (1986)
\item Yamashita, M., Kameda, T.: Computing on anonymous networks: Part I - char- acterizing the solvable cases. IEEE Transactions on Parallel and Distributed Sys- tems 7(1), 69–89 (1996)
\item Yamashita, M., Kameda, T.: Leader election problem on networks in which pro- cessor identity numbers are not distinct. IEEE Transactions on Parallel and Dis- tributed Systems 10(9), 878–887 (1999)
\item Yu, X., Yung, M.: Agent rendezvous: A dynamic symmetry-breaking problem. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 610–621. Springer, Heidelberg (1996)
\end{enumerate}
}