Synchronization helps robots to detect black holes in directed graphs

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

Volumn 5923 LNCS, Issue , 2009, Pages 86-98

  Kosowski, Adrian ^a,b   Navarra, Alfredo ^c   Pinotti, Cristina M ^c  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

^c UNIVERSITY OF PERUGIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BLACK HOLES; DIRECTED GRAPHS; GRAPH G; HOME BASE; UNDIRECTED GRAPH; UNIQUE IDENTIFIERS; UPPER BOUND; WHITE BOARD;

DISTRIBUTED COMPUTER SYSTEMS; GRAVITATION; PROBLEM SOLVING; ROBOTS; STARS; SYNCHRONIZATION;

GRAPH THEORY;

EID: 72749083424     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10877-8_9     Document Type: Conference Paper

References (11)

1. Cooper, C., Klasing, R., Radzik, T.: Locating and repairing faults in a network with mobile agents. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol. 5058, pp. 20-32. Springer, Heidelberg (2008)
2. Czyzowicz, J., Kowalski, D.R., Markou, E., Pelc, A.: Searching for a black hole in tree networks. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol. 3544, pp. 67-80. Springer, Heidelberg (2005)
3. Czyzowicz, J., Dobrev, S., Kralovic, R., Miklik, S., Pardubska, D.: Black Hole Search in Directed Graphs. In: SIROCCO 2009. LNCS, vol. 5869. Springer, Heidelberg (to appear, 2010)
4. Dobrev, S., Flocchini, P., Kralovic, R., Prencipe, G., Ruzicka, P., Santoro, N.: Black hole Search in Common Interconnection Networks. Networks 47(2), 61-71 (2006)
5. Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Finding a black hole in an arbitrary network: optimal mobile agents protocols. In: Proc. of 21st ACM Symposium on Principles of Distributed Computing (PODC), pp. 153-162 (2002)
6. Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Mobile search for a black hole in an anonymous ring. Algorithmica 48(1), 67-90 (2007)
7. Dobrev, S., Flocchini, P., Santoro, N.: Improved bounds for optimal black hole search with a network map. In: Kralovic, R., Sýkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 111-122. Springer, Heidelberg (2004)
8. Ga̧asieniec, L., Klasing, R., Martin, R.A., Navarra, A., Zhang, X.: Fast periodic graph exploration with constant memory. Journal of Computer and System Sciences (JCSS) 74(5), 802-822 (2008)
9. Glaus, P.: Locating a Black Hole without the Knowledge of Incoming Link. In: Dolev, S. (ed.) ALGOSENSORS 2009. LNCS, vol. 5804, pp. 128-138. Springer, Heidelberg (2009)
10. Klasing, R., Markou, E., Radzik, T., Sarracco, F.: Approximation bounds for Black Hole Search problems. Networks 52(4), 216-226 (2008)
11. Kosowski, A., Navarra, A.: Graph Decomposition for Improving Memoryless Periodic Exploration. In: Královič, R., Niwiński, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 501-512. Springer, Heidelberg (2009)