Complexity of searching for a black hole

Fundamenta Informaticae

Volumn 71, Issue 2-3, 2006, Pages 229-242

  Czyzowicz, Jurek ^a   Kowalski, Dariusz ^b   Markou, Euripides ^c   Pelc, Andrzej ^a  

^a UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c UNIVERSITY OF ATHENS   (Greece)

Author keywords

Approximation algorithm; Black hole; Graph; Mobile agent; NP hard problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; EDGE DETECTION; GRAPH THEORY; MULTI AGENT SYSTEMS;

APPROXIMATION ALGORITHM; BLACK HOLE; GRAPH; MOBILE AGENT; NP-HARD PROBLEM;

COMPUTER NETWORKS;

EID: 33745119003     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. J. Czyzowicz, D. Kowalski, E. Markou, A. Pelc, Searching for a black hole in tree networks, Proc. 8th International Conference on Principles of Distributed Systems (OPODIS'2004), LNCS 3544, 67-80.
2. S. Dobrev, P. Flocchini, R. Kralovic, G. Prencipe, P. Ruzicka, N. Santoro, Black hole search by mobile agents in hypercubes and related networks, Proc. of Symposium on Principles of Distributed Systems (OPODIS 2002), 171-182.
3. S. Dobrev, P. Flocchini, G. Prencipe, N. Santoro, Mobile agents searching for a black hole in an anonymous ring, Proc. of 15th International Symposium on Distributed Computing, (DISC 2001), 166-179.
4. S. Dobrev, P. Flocchini, G. Prencipe, N. Santoro, Searching for a black hole in arbitrary networks: Optimal Mobile Agents Protocols, Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), 153-161.
5. S. Dobrev, P. Flocchini, G. Prencipe, N. Santoro, Multiple agents rendezvous on a ring in spite of a black hole, Proc. Symposium on Principles of Distributed Systems (OPODIS 2003), 34-46.
6. M. Halldórsson, S. Ueno, H. Nakao, Y. Kajitani, Approximating Steiner trees in graphs with restricted weights. Networks 31 (1998) 283-292.
7. F. Hohl, Time limited black box security: Protecting mobile agents from malicious hosts, Proc. Conf. on Mobile Agent Security (1998), LNCS 1419, 92-113.
8. F. Hohl, A framework to protect mobile agents by using reference states, Proc. 20th Int. Conf. on Distributed Computing Systems (ICDCS 2000), 410-417.
9. Minimum Steiner Tree. In http://www.nada.kth.se/~viggo/wwwcompendium/ node78. html
10. S. Ng, K. Cheung, Protecting mobile agents against malicious hosts by intention of spreading, Proc. Int. Conf. on Parallel and Distributed Processing and Applications (PDPTA'99), 725-729.
11. G. Robins, A. Zelikovsky, Improved steiner tree approximation in graphs. Proc. 10th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'2000), 770-779.
12. T. Sander, C.F. Tschudin, Protecting mobile agents against malicious hosts, Proc. Conf. on Mobile Agent Security (1998), LNCS 1419, 44-60.
13. K. Schelderup, J. Ines, Mobile agent security - issues and directions, Proc. 6th Int. Conf. on Intelligence and Services in Networks, LNCS 1597 (1999), 155-167.
14. J. Vitek, G. Castagna, Mobile computations and hostile hosts, in: Mobile Objects, D. Tsichritzis, Ed., University of Geneva, 1999, 241-261.