Rendezvous of mobile agents in unknown graphs with faulty links

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4731 LNCS, Issue , 2007, Pages 108-122

  Chalopin, Jérémie ^a   Das, Shantanu ^b   Santoro, Nicola ^c  

^a UNIVERSITÉ DE BORDEAUX   (France)

^b UNIVERSITY OF OTTAWA   (Canada)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; KNOWLEDGE ACQUISITION; PROBLEM SOLVING;

FAULTY LINKS; SURVIVING AGENTS;

MOBILE AGENTS;

EID: 38049038898     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75142-7_11     Document Type: Conference Paper

References (23)

1. Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer, Dordrecht (2003)
2. Angluin, D.: Local and global properties in networks of processors. In: STOC '80. Proc. 12th ACM Symp. on Theory of Computing, pp. 82-93. ACM Press, New York (1980)
3. Barrière, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Rendezvous and Election of Mobile Agents: Impact of Sense of Direction. Theory of Computing Systems 40(2), 143-162 (2007)
4. Boldi, P., Vigna, S.: An effective characterization of computability in anonymous networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 33-47. Springer, Heidelberg (2001)
5. Boldi, P., Vigna, S.: Fibrations of graphs. Discrete Math. 243, 21-66 (2002)
6. Chalopin, J., Das, S., Santoro, N.: Rendezvous of Mobile Agents in Anonymous Networks with Faulty Channels. Technical Report TR-2007-02, University of Ottawa (2007)
7. Chalopin, J., Godard, E., Métivier, Y., Ossamy, R.: Mobile agents algorithms versus message passing algorithms. In: Shvartsman, A.A. (ed.) OPODIS 2006. LNCS, vol. 4305. Springer, Heidelberg (2006)
8. Cooper, C., Klasing, R., Radzik, T.: Searching for black-hole faults in a network using multiple agents. In: Shvartsman, A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 320-332. Springer, Heidelberg (2006)
9. Czyzowicz, J., Kowalski, D., Markou, E., Pele, A.: Searching for a black hole in synchronous tree networks. Combinatorics, Probability and Computing (to appear, 2007)
10. Dessmark, A., Fraigniaud, P., Kowalski, D., Pele, A.: Deterministic rendezvous in graphs. Algorithmica 46, 69-96 (2006)
11. Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Mobile agents searching for a black hole in an anonymous ring. Algorithmica (to appear, 2007)
12. Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Finding a black hole in an arbitrary network: optimal mobile agents protocols. Distributed Computing (to appear, 2007)
13. Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Multiple agents rendezvous in a ring in spite of a black hole. In: Papatriantafilou, M., Hunel, P. (eds.) OPODIS 2003. LNCS, vol. 3144, pp. 34-46. Springer, Heidelberg (2004)
14. Dobrev, S., Flocchini, P., Kralovic, R., Santoro, N.: Exploring a dangerous unknown graph using tokens. In: Proc. of 5th IFIP International Conference on Theoretical Computer Science (TCS'06) (2006)
15. Gasieniec, L., Kranakis, E., Krizanc, D., Zhang, X.: Optimal memory rendezvous of anonymous mobile agents in a unidirectional ring. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 282-292. Springer, Heidelberg (2006)
16. Godard, E., Métivier, Y., Muscholl, A.: Characterization of classes of graphs recognizable by local computations. Theory of Computing Systems 37(2), 249-293 (2004)
17. Klasing, R., Markou, E., Pele, A.: Gathering asynchronous oblivious mobile robots in a ring. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 744-753. Springer, Heidelberg (2006)
18. Klasing, R., Markou, E., Radzik, T., Sarracco, F.: Hardness and approximation results for black hole search in arbitrary networks. Theoretical Computer Science (to appear, 2007)
19. Kranakis, E., Krizanc, D., Markou, E.: Mobile agent rendezvous in a synchronous torus. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 653-664. Springer, Heidelberg (2006)
20. Mazurkiewicz, A.: Distributed enumeration. Inf. Processing Letters 61(5), 233-239 (1997)
21. Sakamoto, N.: Comparison of initial conditions for distributed algorithms on anonymous networks. In: PODC '99. Proc. 18th ACM Symposium on Principles of Distributed Computing, pp. 173-179. ACM Press, New York (1999)
22. Yamashita, M., Kameda, T.: Computing on anonymous networks: Parts I and II. IEEE Trans. Parallel and Distributed Systems 7(1), 69-96 (1996)
23. 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)