B. Csaba, M. Karpinski, and P. Krysta, Approximability of dense and sparse instances of minimum 2- connectivity, TSP and path problems, SODA '02: Proceedings of the thirteenth annual ACM-SIAM Symposium on Discrete algorithms, pp.74-83, 2002.

J. Czyzowicz, D. Kowalski, E. Markou, and A. Pelc, Searching for a black hole in tree networks Searching for a Black Hole in Synchronous Tree Networks, Proceedings of 8th International Conference on Principles of Distributed Systems Combinatorics, Probability and Computing, pp.34-35, 2004.

J. Czyzowicz, D. Kowalski, E. Markou, and A. Pelc, Complexity of searching for a black hole, Fundamenta Informaticae, vol.71, issue.2-3, pp.229-242, 2006.

S. Dobrev, P. Flocchini, R. Kràlovic, G. Prencipe, P. Ruzicka et al., Black hole search in common interconnection networks. Networks Black Hole Search by Mobile Agents in Hypercubes and Related Networks, Proc. 6th Int. Conf. on Principles of Distributed Systems, pp.169-180, 2002.

S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro, Mobile search for a black hole in an anonymous ring. Algorithmica, to appear, Preliminary version in Proc. 15th Int. Symposium on Distributed Computing, pp.166-179, 2001.

S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro, Searching for a black hole in arbitrary networks, Proceedings of the twenty-first annual symposium on Principles of distributed computing , PODC '02, pp.153-161, 2002.
DOI : 10.1145/571825.571853

L. Engebretsen and M. Karpinski, TSP with bounded metrics, Journal of Computer and System Sciences, vol.72, issue.4, 2005.
DOI : 10.1016/j.jcss.2005.12.001

R. Klasing, E. Markou, T. Radzik, and F. Sarracco, Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs, Proc. 12th Int. Colloquium on Structural Information and Communication Complexity (SIROCCO 2005), Springer LNCS, pp.200-215, 2005.
DOI : 10.1007/11429647_17
URL : https://hal.archives-ouvertes.fr/hal-00307229

S. Ng and K. Cheung, Protecting mobile agents against malicious hosts by intention of spreading, Proc. Int. Conf. on Parallel and Distributed Processing and Applications (PDPTA'99), pp.725-729, 1999.

T. Sander and C. F. Tschudin, Protecting Mobile Agents Against Malicious Hosts, Proc. Conf. on Mobile Agent Security, pp.44-60, 1998.
DOI : 10.1007/3-540-68671-1_4

K. Schelderup and J. Olnes, Mobile Agent Security ??? Issues and Directions, Proc. 6th Int. Conf. on Intelligence and Services in Networks, pp.155-167, 1999.
DOI : 10.1007/3-540-48888-X_16

R. Seidel, On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs, Journal of Computer and System Sciences, vol.51, issue.3, pp.400-403, 1995.
DOI : 10.1006/jcss.1995.1078

I. Unité-de-recherche, . Lorraine, . Loria, and . Technopôle-de-nancy, Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt, Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex (France) Unité de recherche INRIA Sophia Antipolis : 2004, route des Lucioles -BP 93 -06902 Sophia Antipolis Cedex

I. De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399