Hardness and approximation results for black hole search in arbitrary graphs

Lecture Notes in Computer Science

Volumn 3499, Issue , 2005, Pages 200-215

  Klasing, Ralf ^a   Markou, Euripides ^b   Radzik, Tomasz ^c   Sarracco, Fabiano ^d  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b UNIVERSITY OF ATHENS   (Greece)

^c KING'S COLLEGE LONDON   (United Kingdom)

^d SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Approximation algorithm; Black hole search; Graph exploration; Mobile agent; NP hardness

Indexed keywords

ALGORITHMS; GRAPH THEORY; MOBILE COMPUTING; PROBLEM SOLVING; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS; BLACK HOLE SEARCH; GRAPH EXPLORATION; MOBILE AGENTS; NP-HARDNESS;

APPROXIMATION THEORY;

EID: 24944494818     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11429647_17     Document Type: Conference Paper

References (13)

1. J. Czyzowicz, D. Kowalski, E. Markou, and A. Pelc. Complexity of searching for a black hole. 2004. manuscript.
2. J. Czyzowicz, D. Kowalski, E. Markou, and A. Pelc. Searching for a black hole in tree networks. In Proc. of 8th International Conference on Principles of Distributed Systems (OPODIS 2004), pages 34-35, 2004.
3. S. Dobrev, P. Flocchini, R. Kralovic, G. Prencipe, P. Ruzicka, and N. Santoro. Black hole search by mobile agents in hypercubes and related networks. In Proc. of 6th International Conference on Principles of Distributed Systems (OPODIS 2002), pages 169-180, 2002.
4. S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Mobile agents searching for a black hole in an anonymous ring. In Proc. of 15th International Symposium on Distributed Computing (DISC 2001), pages 166-179, 2001.
5. S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Searching for a black hole in arbitrary networks: Optimal mobile agents protocols. In Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), pages 153-161, 2002.
6. S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Multiple agents rendezvous on a ring in spite of a black hole. In Proc. 7th International Conference on Principles of Distributed Systems (OPODIS 2003), 2003.
7. M. R. Garey, D. S. Johnson, and R. E. Tarjan. The planar hamiltonian circuit problem is np-complete. SIAM Journal on Computing, 5(4):704-714, 1976.
8. F. Hohl. Time limited black box security: Protecting mobile agents from malicious hosts. In Proc. Conf. on Mobile Agent Security, LNCS 1419, pages 92-113, 1998.
9. F. Hohl. A framework to protect mobile agents by using reference states. In Proc. 20th Int. Conf. on Distributed Computing Systems (ICDCS 2000), pages 410-417, 2000.
10. S. Ng and K. Cheung. Protecting mobile agents against malicious hosts by intention of spreading. In Proc. Int. Conf. on Parallel and Distributed Processing and Applications (PDPTA '99), pages 725-729, 1999.
11. T. Sander and C.F. Tschudin. Protecting mobile agents against malicious hosts. In Proc. Conf. on Mobile Agent Security, LNCS 1419, pages 44-60, 1998.
12. K. Schelderup and J. Ines. Mobile agent security - issues and directions. In Proc. 6th Int. Conf. on Intelligence and Services in Networks, LNCS 1597, pages 155-167, 1999.
13. J. Vitek and G. Castagna. Mobile computations and hostile hosts. In D. Tsichritzis, editor, Mobile Objects, pages 241-261. University of Geneva, 1999.